Skip to main content
OlympiadHQ

Browse · MathNet

Print

NMO Selection Tests for the Junior Balkan Mathematical Olympiad

Romania number theory

Problem

Let be a prime. Find all positive integers such that divides , for all .
Solution
To prove , set to obtain , hence , as needed. For the second implication, observe that implies , so . The identity holds for all integers . Consequently, by induction, the claim is proved. The divisors of greater than are and . Subtracting from the numbers listed above yields the required values for .
Final answer
All positive integers x such that 5p + x divides 30p^2, equivalently x = d − 5p where d runs over the divisors of 30p^2 greater than 5p. Explicitly: x ∈ {p, 5p, 10p, 25p, p(p−5), p(2p−5), p(3p−5), 5p(p−1), p(6p−5), 5p(2p−1), 5p(3p−1), 5p(6p−1)}.

Techniques

Prime numbersFactorization techniquesRecurrence relations