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.
Codex Wiki