olymmath

AUSTRIAN-POLISH 1999 Problem 5

    A sequence of integers (an)(a_n) satisfies an+1=an3+1999a_{n+1} = a_n^3 + 1999 for n=1,2,....n = 1,2,.... Prove that there exists at most one nn for which ana_n is a perfect square.

    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 austrian-polish/1999/p5 · Tag X3F7Q3Q6Q7 · Edit this page on GitHub · Keys: j next, k previous