MathDB
Putnam 2019 B5

Source:

December 10, 2019

Problem Statement

Let FmF_m be the mm'th Fibonacci number, defined by F1=F2=1F_1=F_2=1 and Fm=Fm1+Fm2F_m = F_{m-1}+F_{m-2} for all m3m \geq 3. Let p(x)p(x) be the polynomial of degree 1008 such that p(2n+1)=F2n+1p(2n+1)=F_{2n+1} for n=0,1,2,,1008n=0,1,2,\ldots,1008. Find integers jj and kk such that p(2019)=FjFkp(2019) = F_j - F_k.