Browse · MathNet
Print75th Romanian Mathematical Olympiad
Romania algebra
Problem
Let be a prime, , and an odd number, not a multiple of . Let be a finite field with elements and , the set of elements of order different of in the multiplicative group . Prove that the polynomial has at least coefficients equal to 1.
Solution
As and are odd, is even, in fact a power of , the characteristic of being . It follows that are the roots of . Consider .
The multiplicative group is cyclic of order . Consider one of its generators. For any , with we get In particular, for any we have and , so that and . These give
Because we obtain
For any divisor consider and the polynomial Let the prime subfield of and the divisors of . As and we have that all polynomials have all coefficients or . But then has also this property, moreover at least being non-zero, concluding the proof.
The multiplicative group is cyclic of order . Consider one of its generators. For any , with we get In particular, for any we have and , so that and . These give
Because we obtain
For any divisor consider and the polynomial Let the prime subfield of and the divisors of . As and we have that all polynomials have all coefficients or . But then has also this property, moreover at least being non-zero, concluding the proof.
Techniques
Field TheoryGroup TheoryPolynomial operationsRoots of unity