olymmath

IN-TST 2009 Problem 3

    Let a,ba,b be two distinct odd natural numbers.Define a Sequence <an>n≥0{ < a_n > }_{n\ge 0} like following: a1=aa2=ban=largest odd divisor of (an−1+an−2)a_1 = a a_2 = b a_n = \text{largest odd divisor of }(a_{n - 1} + a_{n - 2}) . Prove that there exists a natural number NN such that an=gcd(a,b)∀n≥Na_n = gcd(a,b) \forall n\ge N .

    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 in-tst/2009/p3 · Tag 40NFEK0M0V · Edit this page on GitHub · Keys: j next, k previous