MathDB
K 34

Source:

May 25, 2007
functionsearchFunctional Equations

Problem Statement

Show that there exists a bijective function f:N0N0 f: \mathbb{N}_{0}\to \mathbb{N}_{0} such that for all m,nN0 m,n\in \mathbb{N}_{0}: f(3mn+m+n)=4f(m)f(n)+f(m)+f(n). f(3mn+m+n)=4f(m)f(n)+f(m)+f(n).