"Let $\mathbb{N}=\{ 1,2,3,\ldots \}$. Determine if there exists a strictly increasing function $f:\mathbb{N}\to\mathbb{N}$ such that
1) $f(1)=2$
2) $f(f(n))=f(n)+n$ for all $n$."
Of the solutions I've seen online, one such $f(n)$ that should work is $$f(n)=\left[\phi n + \frac{1}{2}\right]$$ where $\phi\approx 1.618$ is the golden ratio and the square brackets denote the integral part. It is easy to see that $f(1)=2$ and that $f(n)$ is strictly increasing - however the proof that this satisfies condition 2 seems to be incorrect or unclear in the sources I have found. A clear proof that this $f(n)$ satisfies 2) would be appreciated.