Skip to main content
OlympiadHQ

Browse · MathNet

Print

Team Selection Test for IMO 2011

Turkey 2011 number theory

Problem

Let be a prime, be a positive integer, and let denote the set of congruence classes modulo . Determine the number of functions satisfying the condition for all .
Solution
The answer is . Let for . By induction we obtain for all . If or and , then Since for all , the function defined by , , satisfies the condition of the question for any choice of .

and . We also have . Since , , and for all , the function defined by and , (), satisfies the condition of the question for any choice of and as for all .
Final answer
p^n

Techniques

Modular ArithmeticMultiplicative orderFunctional Equations