olymmath

KMO 1996 Problem 2

    Let the f:N→Nf:\mathbb{N}\rightarrow\mathbb{N} be the function such that (i) For all positive integers n,n, f(n+f(n))=f(n)f(n+f(n))=f(n) (ii) f(no)=1f(n_o)=1 for some n0n_0 Prove that f(n)≡1.f(n)\equiv 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 kr-kmo/1996/p2 · Tag V00S36KP8Q · Edit this page on GitHub · Keys: j next, k previous