Let p be a prime, p≥3, and k an odd number, not a multiple of p. Let K be a finite field with kp+1 elements and A={x1,x2,…,xt}, the set of elements K∗=K∖{0} of order different of k in the multiplicative group (K∗,⋅). Prove that the polynomial P(X)=(X+x1)(X+x2)…(X+xt) has at least p coefficients equal to 1.
Solution
As k and p are odd, ∣K∣ is even, in fact a power of 2, the characteristic of K being 2. It follows that x1,x2,…,xt are the roots of P. Consider P=∑i=0tajXj.
The multiplicative group (K∗,⋅) is cyclic of order kp. Consider a∈K∗ one of its generators. For any s∈{1,2,…,kp}, with (s,kp)=1 we get ord(as)=ord(a)=kp.(1) In particular, for any i∈{1,2,…,p−1} we have (ik+p,k)=(p,k)=1 and (ik+p,p)=(ik,p)=1, so that (ik+p,kp)=1 and ord(aik+p)=kp. These give
Ar=i=0∑p−1a−irkP(aik+p)=i=0∑p−1a−irkj=0∑tajaikj+pj=j=0∑tajapji=0∑p−1ak(j−r)i. Because i=0∑p−1akmi={p,0,if p∣m,if p∤m, we obtain Ar=j=0∑tajapji=0∑p−1ak(j−r)i=p⋅j=0∑⌊pt−r⌋apj+rap(pj+r).
For any divisor d∤kp consider Ud={x∈K∗∣ord(x)=d} and the polynomial Qd=x∈Ud∏(X+x). Let K2={0,1} the prime subfield of K and 1=d1<d2<⋯<dn=kp the divisors of kp. As Q1=X+1∈K2[X] and Qdi=(Xdi+1)⋅dj∣di,dj=di∏Qdj−1∈K2[X], we have that all polynomials Qdi∈K2[X] have all coefficients 0 or 1. But then P=(Xkp+1)⋅Qk−1∈K2[X] has also this property, moreover at least p being non-zero, concluding the proof.
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: MathNet,
licensed CC-BY-4.0.
Statement and solution reproduced as published; topic and difficulty added by this site.