Browse · MathNet
PrintIMO Team Selection Contest
Estonia number theory
Problem
Let a simple polynomial function be a polynomial function whose coefficients belong to the set . Let be a positive integer, . Find the smallest possible number of non-zero coefficients in a simple polynomial function of th order whose values at all integral arguments are divisible by .
Answer: 2.
Answer: 2.
Solution
A single non-zero coefficient is not sufficient for any as the only simple polynomial functions with a single non-zero coefficient are and but in both cases . Let us show that the values of the polynomial function at all integral arguments are divisible by . (Here is the Euler's totient function.) This shows that having 2 non-zero coefficients is sufficient.
Let be an integer. Let the canonical form of be and let us assume without loss of generality that is divisible by primes and is not divisible by primes . Define and . Let us now show that and . Having , we can conclude that as .
To prove that , it is sufficient to prove for all that . It is sufficient to prove that , as by the assumption . Inequality holds as , are positive integers which are not greater than and not coprime with .
To prove the statement , we derive from Euler's theorem that as and are coprime. Also, and are coprime, therefore, from which . Consequently, .
Let be an integer. Let the canonical form of be and let us assume without loss of generality that is divisible by primes and is not divisible by primes . Define and . Let us now show that and . Having , we can conclude that as .
To prove that , it is sufficient to prove for all that . It is sufficient to prove that , as by the assumption . Inequality holds as , are positive integers which are not greater than and not coprime with .
To prove the statement , we derive from Euler's theorem that as and are coprime. Also, and are coprime, therefore, from which . Consequently, .
Final answer
2
Techniques
φ (Euler's totient)Fermat / Euler / Wilson theoremsFactorization techniques