Maths Olympiad Prep

Library / HMMT February /1301 of 1302

HMMT February, 2020

Algebra Difficulty 6.5 National Olympiad Prove it United States

Problem:
We define F101[x]\mathbb{F}_{101}[x] as the set of all polynomials in xx with coefficients in F101\mathbb{F}_{101} (the integers modulo 101101 with usual addition and subtraction), so that two polynomials are equal if and only if the coefficients of xkx^{k} are equal in F101\mathbb{F}_{101} for each nonnegative integer kk. For example, (x+3)(100x+5)=100x2+2x+15(x+3)(100 x+5)=100 x^{2}+2 x+15 in F101[x]\mathbb{F}_{101}[x] because the corresponding coefficients are equal modulo 101101.
We say that f(x)∈F101[x]f(x) \in \mathbb{F}_{101}[x] is lucky if it has degree at most 10001000 and there exist g(x),h(x)∈F101[x]g(x), h(x) \in \mathbb{F}_{101}[x] such that
f(x)=g(x)(x1001−1)+h(x)101−h(x) f(x)=g(x)\left(x^{1001}-1\right)+h(x)^{101}-h(x)
in F101[x]\mathbb{F}_{101}[x]. Find the number of lucky polynomials.

Solutions — 2

Solution 1

Solution:
Let p=101p=101, m=1001m=1001, and work in the ring R:=Fp[x]/(xm−1)R:=\mathbb{F}_{p}[x] /\left(x^{m}-1\right). We want to find the number of elements aa of this ring that are of the form xp−xx^{p}-x. We first solve this question for a field extension Fpd\mathbb{F}_{p^{d}} of Fp\mathbb{F}_{p}. Note that (x+n)p−(x+n)=xp−x(x+n)^{p}-(x+n)=x^{p}-x for any n∈Fpn \in \mathbb{F}_{p}, and the polynomial tp−t=bt^{p}-t=b has at most pp solutions in Fpd\mathbb{F}_{p^{d}} for any b∈Fpdb \in \mathbb{F}_{p^{d}}. Combining these implies that tp−t=bt^{p}-t=b always has either pp or 00 solutions in Fpd\mathbb{F}_{p^{d}}, so there are pd−1p^{d-1} elements of Fpd\mathbb{F}_{p^{d}} expressible in the form xp−xx^{p}-x.

Now, note that we may factor RR into a product of field extensions of Fp\mathbb{F}_{p}, each corresponding to an irreducible factor of xm−1x^{m}-1 in Fp\mathbb{F}_{p}, as the polynomial xm−1x^{m}-1 has no double roots in Fp\mathbb{F}_{p} as p∤mp \nmid m. 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 dd will yield pd−1p^{d-1} lucky polynomials. Thus, the final answer is pm−qp^{m-q}, where qq is the number of fields in the factorization of RR into fields.

To do determine qq, we first factor
xm−1=∏k∣mΦk(x) x^{m}-1=\prod_{k \mid m} \Phi_{k}(x)
in Z[x]\mathbb{Z}[x] where Φk(x)\Phi_{k}(x) are the cyclotomic polynomials. Then we compute the number of irreducible divisors of the cyclotomic polynomial Φk(x)\Phi_{k}(x) in Fp[x]\mathbb{F}_{p}[x]. We claim that this is equal to φ(k)ord⁡k(p)\frac{\varphi(k)}{\operatorname{ord}_{k}(p)}. Indeed, note that given a root ω\omega of Φk\Phi_{k} in the algebraic closure of Fp\mathbb{F}_{p}, the roots of its minimal polynomial are ω,ωp,ωp2,…\omega, \omega^{p}, \omega^{p^{2}}, \ldots, and this will cycle after the numerator repeats modulo kk, from which it follows that the degree of the minimal polynomial of ω\omega is ord⁡k(p)\operatorname{ord}_{k}(p). Thus, Φk(x)\Phi_{k}(x) factors into φ(k)ord⁡k(p)\frac{\varphi(k)}{\operatorname{ord}_{k}(p)} irreducible polynomials.

It remains to compute orders. We have that
ord⁡7(101)=ord⁡7(3)=6ord⁡11(101)=ord⁡11(2)=10ord⁡13(101)=ord⁡13(10)=6 \begin{aligned} \operatorname{ord}_{7}(101)=\operatorname{ord}_{7}(3) & =6 \\ \operatorname{ord}_{11}(101)=\operatorname{ord}_{11}(2) & =10 \\ \operatorname{ord}_{13}(101)=\operatorname{ord}_{13}(10) & =6 \end{aligned}
Thus,
ord⁡77(101)=30ord⁡91(101)=6ord⁡143(101)=30ord⁡1001(101)=30ord⁡1(101)=1 \begin{aligned} \operatorname{ord}_{77}(101) & =30 \\ \operatorname{ord}_{91}(101) & =6 \\ \operatorname{ord}_{143}(101) & =30 \\ \operatorname{ord}_{1001}(101) & =30 \\ \operatorname{ord}_{1}(101) & =1 \end{aligned}
The number of factors of x1001−1x^{1001}-1 in F101[x]\mathbb{F}_{101}[x] is thus
11+66+1010+126+6030+726+12030+72030=1+1+1+2+2+12+4+24=47 \frac{1}{1}+\frac{6}{6}+\frac{10}{10}+\frac{12}{6}+\frac{60}{30}+\frac{72}{6}+\frac{120}{30}+\frac{720}{30}=1+1+1+2+2+12+4+24=47
so the total number of lucky polynomials is 1011001−47=101954101^{1001-47}=101^{954}.

Solution 2

Solution:
As in the previous solution, we work in the ring R=Fp/(xm−1)R=\mathbb{F}_{p} /\left(x^{m}-1\right), which we can treat as the set of polynomials in Fp[x]\mathbb{F}_{p}[x] with degree less than mm. The problem is asking us for the number of elements of the map α:h↦hp−h\alpha: h \mapsto h^{p}-h in RR. Note that this map is linear because (a+b)p=ap+bp(a+b)^{p}=a^{p}+b^{p} in any field where p=0p=0 (which RR is an example of). Hence it suffices to determine the size of the kernel of α\alpha.

We can directly compute that if
h(x)=am−1xm−1+am−2xm−2+⋯+a1x+a0 h(x)=a_{m-1} x^{m-1}+a_{m-2} x^{m-2}+\cdots+a_{1} x+a_{0}
then
h(x)p=am−1xp(m−1)+am−2xp(m−2)+⋯+a1xp+a0 h(x)^{p}=a_{m-1} x^{p(m-1)}+a_{m-2} x^{p(m-2)}+\cdots+a_{1} x^{p}+a_{0}
where exponents are taken modulo mm. Therefore hh is in the kernel if and only if ak=apka_{k}=a_{p k} for all kk where indices are taken modulo mm. Letting qq denote the number of orbits of the map x↦pxx \mapsto p x in Z/mZ\mathbb{Z} / m \mathbb{Z}, the size of the kernel is then pqp^{q} so the size of the image is pm−qp^{m-q}. It remains to compute qq, which will end up being the same computation as in the previous solution.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.