Question

Difficulty: Very hardEstimation, Rounding, and Sequences

A sequence of positive real numbers a1,a2,a3,a_1, a_2, a_3, \dots is defined by a1=3a_1 = 3 and an+1=an+2ana_{n+1} = a_n + \frac{2}{a_n} for all integers n1n \ge 1. Which of the following statements must be true? Select all that apply.

  1. The sequence a1,a2,a3,a_1, a_2, a_3, \dots is strictly increasing.Answer
  2. The term a50a_{50} is strictly greater than 1414.Answer
  3. C
    When a50a_{50} is rounded to the nearest integer, the result is 1515.
  4. The sequence of consecutive term differences dn=an+1and_n = a_{n+1} - a_n is strictly decreasing for n1n \ge 1.Answer
  5. E
    The term a100a_{100} is strictly greater than 2525.

Answer

The correct statements are that the sequence is strictly increasing, the term a50a_{50} is strictly greater than 14, and the sequence of consecutive term differences dn=an+1and_n = a_{n+1} - a_n is strictly decreasing.
The statement asserting strict monotonicity is correct because an+1an=2an>0a_{n+1} - a_n = \frac{2}{a_n} > 0 for positive terms. The statement regarding a50>14a_{50} > 14 is correct because a502>32+4(49)=205>196a_{50}^2 > 3^2 + 4(49) = 205 > 196. The statement concerning consecutive differences is correct because 2an\frac{2}{a_n} strictly decreases as ana_n increases.

Step-by-Step Solution

1
Analyze monotonicity of the sequence
an+1an=2an>0a_{n+1} - a_n = \frac{2}{a_n} > 0 for all n1n \ge 1
Since a1=3>0a_1 = 3 > 0, all terms remain positive, making each term strictly larger than the previous.
2
Analyze the sequence of term differences
dn=2and_n = \frac{2}{a_n} decreases as ana_n increases
Since ana_n grows strictly monotonically, its reciprocal strictly decreases, so dn+1<dnd_{n+1} < d_n.
3
Derive a lower bound for a50a_{50} using quadratic expansion
a502>205    a50>14a_{50}^2 > 205 \implies a_{50} > 14
Expanding ak+12=ak2+4+4ak2>ak2+4a_{k+1}^2 = a_k^2 + 4 + \frac{4}{a_k^2} > a_k^2 + 4 and summing from k=1k=1 to 4949 gives a502>32+4(49)=205>196=142a_{50}^2 > 3^2 + 4(49) = 205 > 196 = 14^2.
4
Derive an upper bound for a50a_{50} to test the rounding statement
a50<14.45a_{50} < 14.45, so rounding to the nearest integer yields 14
Using 4ak2<44k+5\frac{4}{a_k^2} < \frac{4}{4k+5}, the sum of error terms is bounded above by 04944x+5dx=ln(40.2)3.7\int_0^{49} \frac{4}{4x+5} dx = \ln(40.2) \approx 3.7. Thus a502<208.7<14.52a_{50}^2 < 208.7 < 14.5^2, so a50a_{50} rounds to 14, not 15.
5
Estimate a100a_{100} to test the magnitude bound
a100<409.420.23<25a_{100} < \sqrt{409.4} \approx 20.23 < 25
Summing the squared recurrence up to 100 terms gives a1002<405+ln(80.2)409.4a_{100}^2 < 405 + \ln(80.2) \approx 409.4, showing a100a_{100} cannot exceed 25.

Key Concept

Estimation of non-linear recursive sequences using squared bounds and integral comparison.
Estimated Time:3m 0s
Rate this question