MathDB
K 2

Source:

May 25, 2007
functioninductionstrong inductionnumber theoryprime factorizationFunctional Equations

Problem Statement

Find all surjective functions f:NNf: \mathbb{N}\to \mathbb{N} such that for all m,nNm,n\in \mathbb{N}: mnf(m)f(n).m \vert n \Longleftrightarrow f(m) \vert f(n).