Browse · MathNet
Print67th Romanian Mathematical Olympiad
Romania algebra
Problem
Let be a finite field of cardinality , and let be the set of degree polynomials in whose coefficients are all non-zero and pairwise distinct. Determine the number of polynomials in having distinct roots in . Mariean Andronache
Solution
The required number is , where is Euler's totient function. Since every polynomial in is associated in divisibility with a unique polynomial in such that , it is sufficient to count the polynomials of the form satisfying the condition in the statement.
Let be such a polynomial, let be its roots, write , and let and
Since for all in , Since and is invertible in , it follows that is of rank 1, so its minors all vanish. In particular, i.e., , , ..., , so the set of coefficients of is . Since this set is equal to , it follows that is a generator of the multiplicative group , and .
Conversely, if is a generator of the multiplicative group , the polynomial satisfies the condition in the statement, since , so the roots of are , where runs through .
Finally, recall that has exactly generators, to conclude that the required number is indeed .
Let be such a polynomial, let be its roots, write , and let and
Since for all in , Since and is invertible in , it follows that is of rank 1, so its minors all vanish. In particular, i.e., , , ..., , so the set of coefficients of is . Since this set is equal to , it follows that is a generator of the multiplicative group , and .
Conversely, if is a generator of the multiplicative group , the polynomial satisfies the condition in the statement, since , so the roots of are , where runs through .
Finally, recall that has exactly generators, to conclude that the required number is indeed .
Final answer
(q-1)φ(q-1)
Techniques
Group TheoryMatricesDeterminantsPolynomial operationsRoots of unityφ (Euler's totient)