Olympiad problems

2016 Mathematical Talent Reward Programme, SAQ: P 5

Let $\mathbb{N}$ be the set of all positive integers. $f,g:\mathbb{N} \to \mathbb{N}$ be funtions such that $f$ is onto and $g$ is one-one and $f(n)\geq g(n)$ for all positive integers $n$. Prove that $f=g$.

2016 Taiwan TST Round 1, 3

Tags: function , number theory , binomial coefficient , surjective function , algebra

Let $\mathbb{Z}^+$ denote the set of all positive integers. Find all surjective functions $f:\mathbb{Z}^+ \times \mathbb{Z}^+ \rightarrow \mathbb{Z}^+$ that satisfy all of the following conditions: for all $a,b,c \in \mathbb{Z}^+$, (i)$f(a,b) \leq a+b$; (ii)$f(a,f(b,c))=f(f(a,b),c)$ (iii)Both $\binom{f(a,b)}{a}$ and $\binom{f(a,b)}{b}$ are odd numbers.(where $\binom{n}{k}$ denotes the binomial coefficients)

2022 IFYM, Sozopol, 4

Tags: surjective function , function problem , algebra

Does there exist a surjective function $f:\mathbb{R} \rightarrow \mathbb{R}$ for which $f(x+y)-f(x)-f(y)$ takes only 0 and 1 for values for random $x$ and $y$?