olymmath

CZ-SK-MO 1996 Problem 1

    A sequence (Gn)n=0∞(G_n)_{n=0}^{\infty} satisfies G(0)=0G(0) = 0 and G(n)=n−G(G(n−1))G(n) = n-G(G(n-1)) for each n∈Nn \in N . Show that (a) G(k)≥G(k−1)G(k) \ge G(k -1) for every k∈Nk \in N ; (b) there is no integer kk for which G(k−1)=G(k)=G(k+1)G(k -1) = G(k) = G(k +1) .

    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 cz-sk-mo/1996/p1 · Tag MGK094SQ4R · Edit this page on GitHub · Keys: j next, k previous