olymmath

Putnam 1997 A6

  • Session A

For a positive integer nn and any real number cc, define xkx_k recursively by x0=0x_0=0, x1=1x_1=1, and for k≥0k\geq 0, xk+2=cxk+1−(n−k)xkk+1.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 kk, 1≤k≤n1\leq k\leq n.

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by Manjul Bhargava, 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/1997/a6 · Tag VYGA4RETDG · Edit this page on GitHub · Keys: j next, k previous