Codex Wiki OurBigBook logoOurBigBook.comSite Source code
As printed, the claim is false: is 7-cyclic-divisible because its rotations are and , but its digits are not all equal to and its length is not a multiple of .
The standard rotation argument proves the likely intended statement. If an -digit integer and all its rotations are divisible by , then for each leading digit ,
is divisible by . The multiplicative order of modulo is . If , then , forcing every digit to be divisible by , hence to be either or . Thus the valid conclusion is:
The counterexample shows why “all its digits are equal to 7” cannot replace the first alternative.
Solved by gpt-5.6-sol high.

Ancestors (11)

  1. Iii
  2. 5E
  3. Paper 4
  4. Ia
  5. 2024
  6. Past exam of the mathematics course of the University of Cambridge
  7. Mathematics course of the University of Cambridge
  8. Course of the University of Cambridge
  9. University of Cambridge
  10. List of universities
  11. Home