IMC 1998, Day 2, Problem 4
Let , where . Let be the family of all non-constant functions satisfying the following conditions:
(1) for ,
(2) for .
Find the number of functions in .
Original from the official PDF

This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
Solution. It is clear that , given by , does not verify condition (2). Since is the only increasing injection on , does not contain injections. Let us take any and suppose that . Since is increasing, there exists such that . In view of (2), . If , then taking we get , a contradiction. Hence for . If for some , then the similar consideration shows that for . Hence or 1 for every . Therefore for . If , then taking we get , a contradiction. Thus, for . Let . Since is non-constant . Since , . If for some , then and belong to and this contradicts the facts above. Hence for . Thus we show that every function in is defined by natural numbers , where .
Then
Transcribed from the official solutions, pages 2–3. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.