Maths Olympiad Prep

Library / Putnam /29 of 60

Putnam

Algebra Difficulty 7.8 National Olympiad, round 2 Find the answer

Let pp be an odd prime number, and let Fp\mathbb{F}_p denote the field of integers modulo pp. Let Fp[x]\mathbb{F}_p[x] be the ring of polynomials over Fp\mathbb{F}_p, and let q(x)∈Fp[x]q(x) \in \mathbb{F}_p[x] be given by q(x)=∑k=1p−1akxk, q(x) = \sum_{k=1}^{p-1} a_k x^k, where ak=k(p−1)/2mod  p. a_k = k^{(p-1)/2} \mod{p}. Find the greatest nonnegative integer nn such that (x−1)n(x-1)^n divides q(x)q(x) in Fp[x]\mathbb{F}_p[x].

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

The answer is p−12\frac{p-1}{2}. Define the operator D=xddxD = x \frac{d}{dx}, where ddx\frac{d}{dx} indicates formal differentiation of polynomials. For nn as in the problem statement, we have q(x)=(x−1)nr(x)q(x) = (x-1)^n r(x) for some polynomial r(x)r(x) in Fp\mathbb{F}_p not divisible by x−1x-1. For m=0,…,nm=0,\dots,n, by the product rule we have (Dmq)(x)≡nmxm(x−1)n−mr(x)(mod(x−1)n−m+1). (D^m q)(x) \equiv n^m x^m (x-1)^{n-m} r(x) \pmod{(x-1)^{n-m+1}}. Since r(1)≠0r(1) \neq 0 and n≢0(modp)n \not\equiv 0 \pmod{p} (because n≤deg⁡(q)=p−1n \leq \deg(q) = p-1), we may identify nn as the smallest nonnegative integer for which (Dnq)(1)≠0(D^n q)(1) \neq 0.

Now note that q=D(p−1)/2sq = D^{(p-1)/2} s for s(x)=1+x+⋯+xp−1=xp−1x−1=(x−1)p−1 s(x) = 1 + x + \cdots + x^{p-1} = \frac{x^p-1}{x-1} = (x-1)^{p-1} since (x−1)p=xp−1(x-1)^p = x^p-1 in Fp[x]\mathbb{F}_p[x]. By the same logic as above, (Dns)(1)=0(D^n s)(1) = 0 for n=0,…,p−2n=0,\dots,p-2 but not for n=p−1n=p-1. This implies the claimed result.

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: Omni-MATH, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.