Sunday, November 29, 2015

Functional Equation Problems

If $\Bbb N$ denotes all positive integers. Then find all functions $f: \mathbb{N} \to \mathbb{N}$ which are strictly increasing and such for all positive integers $n$, we have:



$$f(f(n)) = n+2$$



So far I know that $f(n)$ is greater than $n$ because the function is strictly increasing, but I'm not sure how to use this in order to solve the equation.

No comments:

Post a Comment

analysis - Injection, making bijection

I have injection $f \colon A \rightarrow B$ and I want to get bijection. Can I just resting codomain to $f(A)$? I know that every function i...