Problem:
The sequence is defined as follows: , for . Prove that .
Solution
Solution:
First we must notice that for we have , then . This is basic to any estimation.
The obvious approach is to notice that if , then . Hence it takes at most steps to get from to . Unfortunately, this does not quite work: we need steps to get from to .
The trick is to notice that . But , so . That gives .
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.