AlgebraDifficulty 7.7National olympiad, round 2Find the answer
Let p be a prime number and Fp be the field of residues modulo p. Let W be the smallest set of polynomials with coefficients in Fp such that the polynomials x+1 and xp−2+xp−3+⋯+x2+2x+1 are in W, and for any polynomials h1(x) and h2(x) in W the polynomial r(x), which is the remainder of h1(h2(x)) modulo xp−x, is also in W. How many polynomials are there in W ?
A number or a short expression. Spacing and $ signs are ignored.
Solution
Note that both of our polynomials are bijective functions on Fp: f1(x)=x+1 is the cycle 0→1→2→⋯→(p−1)→0 and f2(x)=xp−2+xp−3+⋯+x2+2x+1 is the transposition 0↔1 (this follows from the formula f2(x)=x−1xp−1−1+x and Fermat's little theorem). So any composition formed from them is also a bijection, and reduction modulo xp−x does not change the evaluation in Fp. Also note that the transposition and the cycle generate the symmetric group ( f1k∘f2∘f1p−k is the transposition k↔(k+1), and transpositions of consecutive elements clearly generate Sp ), so we get all p! permutations of the elements of Fp. The set W only contains polynomials of degree at most p−1. This means that two distinct elements of W cannot represent the same permutation. So W must contain those polynomials of degree at most p−1 which permute the elements of Fp. By minimality, W has exactly these p! elements.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.