Maths Olympiad Prep

Track / Stage 6 / 45 of 400 #1685 of 2604

Problem 1685

National Olympiad, first round
Algebra Difficulty 6.0 Prove it Vietnamese Mathematical Olympiad · Vietnam

a) Let (an)(a_n) be a sequence defined by an=ln⁡(2n2+1)−ln⁡(n2+n+1)a_n = \ln(2n^2 + 1) - \ln(n^2 + n + 1) for all positive integers nn. Prove that there are finite values of nn such that {an}<12\{a_n\} < \frac{1}{2}.

b) Let (bn)(b_n) be a sequence defined by bn=ln⁡(2n2+1)+ln⁡(n2+n+1)b_n = \ln(2n^2 + 1) + \ln(n^2 + n + 1) for all positive integers nn. Prove that there are infinite values of nn such that {bn}<12016\{b_n\} < \frac{1}{2016}.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

a.
It is obvious that 1≤2n2+1n2−n+1≤21 \le \frac{2n^2 + 1}{n^2 - n + 1} \le 2 for all n∈Z+n \in \mathbb{Z}^+. Hence, 0≤an≤ln⁡2<10 \le a_n \le \ln 2 < 1 and ⌊an⌋=0\lfloor a_n \rfloor = 0. It follows that {an}=an\{a_n\} = a_n and
lim⁡n→∞{an}=lim⁡n→∞an=lim⁡n→∞ln⁡2n2+1n2+n+1=ln⁡2. \lim_{n \to \infty} \{a_n\} = \lim_{n \to \infty} a_n = \lim_{n \to \infty} \ln \frac{2n^2 + 1}{n^2 + n + 1} = \ln 2.
Therefore, there exists a positive integer n0n_0 such that
{an}>ln⁡2−12016,∀n≥n0. \{a_n\} > \ln 2 - \frac{1}{2016}, \forall n \ge n_0.
Then by direct calculation, it deduces that for n>n0n > n_0,
{an}=an>ln⁡2−12016>12. \{a_n\} = a_n > \ln 2 - \frac{1}{2016} > \frac{1}{2}.

b.
lim⁡n→∞(bn−bn−1)=lim⁡n→∞ln⁡(2n2+1)(n2+n+1)(2n2−4n+3)(n2−n+1)=0. \lim_{n \to \infty} (b_n - b_{n-1}) = \lim_{n \to \infty} \ln \frac{(2n^2 + 1)(n^2 + n + 1)}{(2n^2 - 4n + 3)(n^2 - n + 1)} = 0.
Back to our problem, assume that there exists finite values of nn that {bn}<12016\{b_n\} < \frac{1}{2016}. It follows that there exists a positive integer n0n_0 that {bn}≥12016\{b_n\} \ge \frac{1}{2016} for all nn. Because lim⁡n→∞(bn−bn−1)=0\lim_{n \to \infty} (b_n - b_{n-1}) = 0, it implies that there exists a positive integer n1n_1 that
bn−bn−1<12016 b_n - b_{n-1} < \frac{1}{2016}
for all n≥n1n \ge n_1. Because (bn)(b_n) is an increasing sequence and lim⁡n→∞bn=+∞\lim_{n \to \infty} b_n = +\infty, it follows that there exists infinite values of n>max⁡{n0,n1}n > \max\{n_0, n_1\} which [bn]−[bn−1]=1[b_n] - [b_{n-1}] = 1. Consider such values of nn, by the above inequality, we obtain
[bn]−[bn−1]+{bn}−{bn−1}<12016 [b_n] - [b_{n-1}] + \{b_n\} - \{b_{n-1}\} < \frac{1}{2016}
or
{bn−1}>{bn}+20152016 \{b_{n-1}\} > \{b_n\} + \frac{2015}{2016}
Notice that {bn}≥12016\{b_n\} \ge \frac{1}{2016}, thus {bn−1}>1\{b_{n-1}\} > 1. This contradiction finishes the given problem. □\square

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.