Problem:
We define as the set of all polynomials in with coefficients in (the integers modulo with usual addition and subtraction), so that two polynomials are equal if and only if the coefficients of are equal in for each nonnegative integer . For example, in because the corresponding coefficients are equal modulo .
We say that is lucky if it has degree at most and there exist such that
in . Find the number of lucky polynomials.
, 2020
Solutions — 2
Solution 1
Solution:
Let , , and work in the ring . We want to find the number of elements of this ring that are of the form . We first solve this question for a field extension of . Note that for any , and the polynomial has at most solutions in for any . Combining these implies that always has either or solutions in , so there are elements of expressible in the form .
Now, note that we may factor into a product of field extensions of , each corresponding to an irreducible factor of in , as the polynomial has no double roots in as . By the Chinese Remainder Theorem, we may multiply the number of lucky polynomials for each of the field extensions to find the final answer. A field extension of degree will yield lucky polynomials. Thus, the final answer is , where is the number of fields in the factorization of into fields.
To do determine , we first factor
in where are the cyclotomic polynomials. Then we compute the number of irreducible divisors of the cyclotomic polynomial in . We claim that this is equal to . Indeed, note that given a root of in the algebraic closure of , the roots of its minimal polynomial are , and this will cycle after the numerator repeats modulo , from which it follows that the degree of the minimal polynomial of is . Thus, factors into irreducible polynomials.
It remains to compute orders. We have that
Thus,
The number of factors of in is thus
so the total number of lucky polynomials is .
Solution 2
Solution:
As in the previous solution, we work in the ring , which we can treat as the set of polynomials in with degree less than . The problem is asking us for the number of elements of the map in . Note that this map is linear because in any field where (which is an example of). Hence it suffices to determine the size of the kernel of .
We can directly compute that if
then
where exponents are taken modulo . Therefore is in the kernel if and only if for all where indices are taken modulo . Letting denote the number of orbits of the map in , the size of the kernel is then so the size of the image is . It remains to compute , which will end up being the same computation as in the previous solution.