Let a0,a1,a2,… denote the sequence of real numbers such that a0=2 and an+1=1+anan for n≥0. Compute a2012.
A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.
Solution
Calculating out the first few terms, note that they follow the pattern an=2n+12. Plugging this back into the recursion shows that it indeed works.
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.
Source: Omni-MATH,
licensed Apache-2.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.