MathDB
constructing every positive integer with 3 operations

Source: Nordic Mathematical Contest 1990 #4

October 5, 2017
positive integernumber theoryOperation

Problem Statement

It is possible to perform three operations f,gf, g, and hh for positive integers: f(n)=10n,g(n)=10n+4f(n) = 10n, g(n) = 10n + 4, and h(2n)=nh(2n) = n; in other words, one may write 00 or 44 in the end of the number and one may divide an even number by 22. Prove: every positive integer can be constructed starting from 44 and performing a finite number of the operations f,g,f, g, and hh in some order.