MathDB
Putnam 1997 A6

Source:

May 30, 2014
Putnamcollege contests

Problem Statement

For a positive integer nn and any real number cc, define xkx_k recursively by : x0=0,x1=1 and for k0,  xk+2=cxk+1(nk)xkk+1 x_0=0,x_1=1 \text{ and for }k\ge 0, \;x_{k+2}=\frac{cx_{k+1}-(n-k)x_k}{k+1} Fix nn and then take cc to be the largest value for which xn+1=0x_{n+1}=0. Find xkx_k in terms of nn and k,  1knk,\; 1\le k\le n.