Suppose function satisfies
(1) , we have ;
(2) , .
Prove that for all .
Solution
By (1), and take , we have .
Now, suppose there exists such that . By using (1), we have
In fact, by mathematical induction, and use (1) repeatedly, it is easy to show that
for all positive integers . However, since is a constant, we can choose sufficiently large such that and , which contradicts (2).
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.