Problem:
A sequence of real numbers with , , and satisfies
for all , but cannot be extended to . In other words, no values of satisfy
Compute the smallest possible value of .
, 2019
Solution
Solution:
Say . Then using the recursion equation, we have , , , , , and .
Now we have . No value of can satisfy this equation iff and . Since is , we want , which gives . The only positive root of this equation is .
This problem can also be solved by a tangent substitution. Write . The given condition becomes
We are given , , and . Using this, we can recursively compute in terms of until we get to . For not to exist, we need . The only possible value of is , which 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.