IMC 2024, Day 2, Problem 10
We say that a square-free positive integer is almost prime if
for all integers , where are all the positive divisors of . Suppose that is a Fermat prime (i.e. it is a prime of the form for an integer ), is a prime divisor of an almost prime integer , and . Show that, with the above notation, for all .
(An integer is called square-free if it is not divisible by for any integer .)
Original from the official PDF

This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
(proposed by Tigran Hakobyan, Yerevan State University, Vanadzor, Armenia)
Solution. We first prove the following claims.
Lemma 1. If is almost prime then .
Proof. Assume to the contrary that so that there are primes and dividing such that . For let be the number of positive divisors of congruent to modulo and similarly for let denote the number of positive divisors of congruent to modulo . Observe that the polynomial defines the zero function on due to the condition of the problem. On the other hand, in , so that for all . It follows that which is a contradiction (here means the number of distinct prime divisors of ). Therefore our assumption was wrong and the lemma is proved.
Lemma 2. Let be a prime number and let be a positive integer coprime to . If is the order of modulo , then there exists such that and
Proof. Observe that for any since . On the other hand, the numbers leave different remainders upon division by and therefore the polynomial
Lemma 3. If is almost prime then for any primes and dividing , the order of modulo is an odd number.
Proof. Observe that due to Lemma 1 the order of modulo is well defined and assume to the contrary that is an even number. According to Lemma 2 there exists such that and , where . Let us consider the sequence defined by and for . Notice that since is even by the assumption, we have . It follows that
Let us get back to the problem. Suppose that is prime and is a Fermat's prime such that . If is any prime divisor of , then by Lemma 3 we have that for some odd , so that and therefore . Hence for any divisor of .
Transcribed from the official solutions, pages 5–6. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.