olymmath

SCHWEITZER 2003 Problem 6

    Show that the recursion n=xn(xn−1+xn+xn+1)n=x_n(x_{n-1}+x_n+x_{n+1}) , n=1,2,…n=1,2,\ldots , x0=0x_0=0 has exaclty one nonnegative solution.

    (translated by L. Erdős)

    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 schweitzer/2003/p6 · Tag FFPEGYXV11 · Edit this page on GitHub · Keys: j next, k previous