Home Competitions OIMU 1998 Problem 5
A sequence of polynomials { f n } n = 0 ∞ \{f_n\}_{n=0}^{\infty} { f n } n = 0 ∞ is defined recursively by f 0 ( x ) = 1 f_0(x)=1 f 0 ( x ) = 1 , f 1 ( x ) = 1 + x f_1(x)=1+x f 1 ( x ) = 1 + x , and
( k + 1 ) f k + 1 ( x ) − ( x + 1 ) f k ( x ) + ( x − k ) f k − 1 ( x ) = 0 , k = 1 , 2 , … (k+1)f_{k+1}(x)-(x+1)f_k(x)+(x-k)f_{k-1}(x)=0, k=1,2,\ldots ( k + 1 ) f k + 1 ( x ) − ( x + 1 ) f k ( x ) + ( x − k ) f k − 1 ( x ) = 0 , k = 1 , 2 , …
Prove that f k ( k ) = 2 k f_k(k)=2^k f k ( k ) = 2 k for all k ≥ 0 k\geq 0 k ≥ 0 .
Dataset text AI-MO AoPS . Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Add a solution
Similar problems
These problems have the most words in common with this statement.
Locator oimu/1998/p5 · Tag CP7N4MXN5S · Edit this page on GitHub · Keys: j next, k previous