MathDB
Surjective functions on N satisfying special condition

Source: MEMO 2015, problem I-1

August 27, 2015
functionalgebra

Problem Statement

Find all surjective functions f:NNf:\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:XYf:X\to Y is said to be surjective if for every yYy\in Y there exists xXx\in X such that f(x)=yf(x)=y.