Maths Olympiad Prep

Library / /30 of 64

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=1p1akxk, q(x) = \sum_{k=1}^{p-1} a_k x^k, where ak=k(p1)/2modp. a_k = k^{(p-1)/2} \mod{p}. Find the greatest nonnegative integer nn such that (x1)n(x-1)^n divides q(x)q(x) in Fp[x]\mathbb{F}_p[x].

A number or a short expression. Spacing and $ signs are ignored.

Solution

The answer is p12\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)=(x1)nr(x)q(x) = (x-1)^n r(x) for some polynomial r(x)r(x) in Fp\mathbb{F}_p not divisible by x1x-1. For m=0,,nm=0,\dots,n, by the product rule we have (Dmq)(x)nmxm(x1)nmr(x)(mod(x1)nm+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 ndeg(q)=p1n \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(p1)/2sq = D^{(p-1)/2} s for s(x)=1+x++xp1=xp1x1=(x1)p1 s(x) = 1 + x + \cdots + x^{p-1} = \frac{x^p-1}{x-1} = (x-1)^{p-1} since (x1)p=xp1(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,,p2n=0,\dots,p-2 but not for n=p1n=p-1. This implies the claimed result.

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

Source: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.