9th ibmo - brazil 1994/q6.
Source: Spanish Communities
May 7, 2006
inductionalgebra unsolvedalgebra
Problem Statement
Show that every natural number can be obtained first with 1 doing less than sums; more precisely, there is a finite sequence of natural numbers x_0,\ x_1,\dots,\ x_k\mbox{ with }k\leq1\;100\;000,\ x_0=1,\ x_k=n such that for all there exist with such that .