MathDB
Prove a function

Source: Indian IMOTC 2004 Day 3 Problem 2

September 23, 2005
functionalgebra unsolvedalgebra

Problem Statement

Define a function g:NNg: \mathbb{N} \mapsto \mathbb{N} by the following rule: (a) gg is nondecrasing (b) for each nn, g(n)g(n) i sthe number of times nn appears in the range of gg, Prove that g(1)=1g(1) = 1 and g(n+1)=1+g(n+1g(g(n)))g(n+1) = 1 + g( n +1 - g(g(n))) for all nNn \in \mathbb{N}