A sequence of positive reals is defined by and for . Define . Observe that the recursion turns into a simple relation for that can be summed, and use it to study the behaviour of for small and for large .
Question 1
Single correct option
The smallest positive integer for which is
- A.
- B.
- C.
- D.
Show answer and solution
Answer: (C)
From we get . Telescoping from : , so . The condition means , i.e. . Since but , the smallest such is . Recognising the telescoping structure of the reciprocals is the entire trick, so b_n is just one plus a triangular number. Checking neighbouring values avoids off-by-one errors: a_45 equals 2/1982, which exceeds 1/1000, whereas a_46 equals 2/2072 and is below it.
Question 2
Single correct option
The value of is
- A.
- B.
- C.
- D.
Show answer and solution
Answer: (B)
We have , which behaves like for large . Then . More rigorously, , which is a Riemann sum in and tends to . Hence the limit equals . Numerical evaluation with the exact sequence for gave , trending to , which supports the answer; would arise from forgetting the upper limit . The scale factor n in front of the sum is exactly what converts the sum of order 1/n into a finite limit, so the answer is the definite integral of 2/u squared from 1 to 2.
Saved on this device. Sign in or create a free account to keep it on every device.