olymmath

INMO 2012 Problem 3

    Define a sequence ⟨f0(x),f1(x),f2(x),…⟩\left\langle f_{0}(x), f_{1}(x), f_{2}(x), \ldots\right\rangle of functions by

    f0(x)=1,f1(x)=x,(fn(x))2−1=fn+1(x)fn−1(x), for n≥1f_{0}(x)=1, f_{1}(x)=x, \left(f_{n}(x)\right)^{2}-1=f_{n+1}(x) f_{n-1}(x), \text { for } n \geq 1

    Prove that each fn(x)f_{n}(x) is a polynomial with integer coefficients.

    Dataset text NuminaMath olympiads. 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

    Locator in-inmo/2012/p3 · Tag KVZ9033QGN · Edit this page on GitHub · Keys: j next, k previous