Skip to main content
OlympiadHQ

Browse · MathNet

Print

The 65th IMO China National Team Selection Test

China number theory

Problem

A positive integer is called a good number if the decimal representation of can be divided into at least 5 segments of digits, each segment containing at least one non-zero digit, and these segments (ignoring any leading zeros) can be viewed as positive integers which can be divided into two groups, with each group forming a geometric sequence in the appropriate order. (If a group has only one or two positive integers, it is also considered a geometric sequence.) For example, 20240327 is a good number. In fact, it can be divided into , a total of 5 segments of digits, with the two groups of positive integers (2, 2, 2) and (7, 403) each forming a geometric sequence. Let be a prime number, where and are integers. Prove that is a good number.
Solution
Let be a prime number, where and are integers. Prove that is a good number.

Proof. Since is a prime number, must be a prime number. Given , we have . Note that divides and does not divide , so the order of modulo is exactly . Therefore, . Let .

Consider the remainder of modulo , which satisfies . By Lagrange's theorem, the solutions to the congruence equation are exactly . Thus, we can assume , where . Furthermore, modulo is , where denotes the remainder modulo , taking values in .

Consider as a digit number, with leading zeros if necessary. Divide into segments of length from left to right (the leftmost segment may contain leading zeros), forming segments corresponding to integers : If , then can be divided into two groups, each forming a geometric sequence.

If , then . Let When , , and when , . Thus, also forms a geometric sequence. This completes the proof.

Techniques

Multiplicative orderFermat / Euler / Wilson theoremsPolynomials mod p