IMC / 2009 / Problems / Day 2, P9
IMC 2009 · Day 2 · P9
hardLet be a prime number and be the field of residues modulo . Let be the smallest set of polynomials with coefficients in such that
- the polynomials and are in , and
- for any polynomials and in the polynomial , which is the remainder of modulo , is also in .
Solution (official)
Note that both of our polynomials are bijective functions on : is the cycle and is the transposition (this follows from the formula and Fermat's little theorem). So any composition formed from them is also a bijection, and reduction modulo does not change the evaluation in . Also note that the transposition and the cycle generate the symmetric group ( is the transposition , and transpositions of consecutive elements clearly generate ), so we get all permutations of the elements of .
The set only contains polynomials of degree at most . This means that two distinct elements of cannot represent the same permutation. So must contain those polynomials of degree at most which permute the elements of . By minimality, has exactly these elements.
How the field did
Score distribution (field cohort)
Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.