olymmath

Putnam 2019 A5

  • Session A

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].

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by Kiran Kedlaya and Lenny Ng

The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).

Locator putnam/2019/a5 · Tag 5C6QY45NF9 · Edit this page on GitHub · Keys: j next, k previous