An Induction to Functional Equations

Algebra Level 4

How many functions f(x)f(x) from integers to integers are there such that for all integer nn we have

f(f(n)+1)=n?f\big(f(n)+1\big)=n?

Note: The main point is not really solving it, but to prove your result.

×

Problem Loading...

Note Loading...

Set Loading...