MathDB
K 12

Source:

May 25, 2007
functioninductionFunctional Equations

Problem Statement

Find all functions f:NNf:\mathbb{N} \to \mathbb{N} such that for all m,nNm,n\in \mathbb{N}: [*] f(2)=2f(2)=2, [*] f(mn)=f(m)f(n)f(mn)=f(m)f(n), [*] f(n+1)>f(n)f(n+1)>f(n).