olymmath

MEMO 2015 I1

    Find all surjective functions f:N→Nf:\mathbb{N}\to\mathbb{N} such that for all positive integers aa and bb , exactly one of the following equations is true: \begin{align*} f(a)&=f(b), f(a+b)&=\min{f(a),f(b)}. \end{align*} Remarks: N\mathbb{N} denotes the set of all positive integers. A function f:X→Yf:X\to Y is said to be surjective if for every y∈Yy\in Y there exists x∈Xx\in X such that f(x)=yf(x)=y .

    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 memo/2015/i1 · Tag S2FCB67TFZ · Edit this page on GitHub · Keys: j next, k previous