olymmath

Putnam 2019 B5

  • Session B

Let FmF_m be the mmth Fibonacci number, defined by F1=F2=1F_1 = F_2 = 1 and Fm=Fm−1+Fm−2F_m = F_{m-1} + F_{m-2} for all m≥3m \geq 3. Let p(x)p(x) be the polynomial of degree 10081008 such that p(2n+1)=F2n+1p(2n+1) = F_{2n+1} for n=0,1,2,…,1008n=0,1,2,\dots,1008. Find integers jj and kk such that p(2019)=Fj−Fkp(2019) = F_j - F_k.

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

Similar problems

These problems have the most words in common with this statement.

Locator putnam/2019/b5 · Tag SJDJQ2ANXT · Edit this page on GitHub · Keys: j next, k previous