MHB Sequence Challenge: Prove $a_{50}+b_{50}>20$

anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
The sequence $\{a_n\}$ and $\{b_n\}$ are such that, for every positive integer $n$, $a_n>0,\,b_n>0,\,a_{n+1}=a_n+\dfrac{1}{b_n}$ and $b_{n+1}=b_n+\dfrac{1}{a_n}$. Prove that $a_{50}+b_{50}>20$.
 
Mathematics news on Phys.org
Let $c_n = a_n+b_n$. Then $$c_{n+1} = a_{n+1} + b_{n+1} = a_n + b_n + \dfrac{1}{b_n}+ \dfrac{1}{a_n} = c_n + \dfrac{c_n}{a_nb_n}.$$ By the AM-GM inequality, $a_nb_n \leqslant \frac14(a_n+b_n)^2 = \frac14c_n^2.$ Therefore $\dfrac1{a_nb_n} \geqslant \dfrac4{c_n^2}$, and it follows that $$c_{n+1} \geqslant c_n + \dfrac4{c_n}.$$ For $x>0$, the function $f(x) = x + \dfrac4x$ has minimum value $4$ (when $x=2$). It follows that $c_2 = f(c_1) \geqslant 4$.

The next step is to prove by induction that $c_n \geqslant 2\sqrt{2n}$ for all $n \geqslant 2$, with strict inequality except possibly when $n=2$. The base case $n=2$ holds, because $c_2 \geqslant 4$. Suppose that the inequality holds for $n$. Since the function $f(x)$ is an increasing function for all $x\geqslant2$, it follows that $f(c_n) \geqslant f(2\sqrt{2n}).$ Therefore $$c_{n+1}^2 = (f(c_n))^2 \geqslant (f(2\sqrt{2n}))^2 = \left(2\sqrt{2n} + \dfrac4{2\sqrt{2n}}\right)^2 = 8n + 8 + \dfrac2n > 8(n+1).$$ Take square roots of each side to get $c_{n+1} > 2\sqrt{2(n+1)}$, which completes the inductive step.

Finally, take $n=50$ to see that $a_{50}+b_{50} = c_{50} > 2\sqrt{100} = 20$.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Replies
1
Views
1K
Replies
3
Views
1K
Replies
3
Views
2K
Replies
1
Views
2K
Replies
9
Views
1K
Replies
8
Views
2K
Replies
4
Views
2K
Replies
2
Views
1K
Back
Top