$a_{1}=1$, $~$ $a_{n+1}-a_{n}=\sqrt{\dfrac{a_{n+1}^{2}-1}{2}}+\sqrt{\dfrac{a_{n}^{2}-1}{2}}$ , $~$ $a_{n+1}>a_{n}$
Prove that $~$ $\displaystyle\sum_{k=1}^{\infty}\frac{1}{a_{n}}<e$
2026-05-15 15:47:54.1778860074
Inequality With Recurrent Relation
96 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in INEQUALITY
- Confirmation of Proof: $\forall n \in \mathbb{N}, \ \pi (n) \geqslant \frac{\log n}{2\log 2}$
- Prove or disprove the following inequality
- Proving that: $||x|^{s/2}-|y|^{s/2}|\le 2|x-y|^{s/2}$
- Show that $x\longmapsto \int_{\mathbb R^n}\frac{f(y)}{|x-y|^{n-\alpha }}dy$ is integrable.
- Solution to a hard inequality
- Is every finite descending sequence in [0,1] in convex hull of certain points?
- Bound for difference between arithmetic and geometric mean
- multiplying the integrands in an inequality of integrals with same limits
- How to prove that $\pi^{e^{\pi^e}}<e^{\pi^{e^{\pi}}}$
- Proving a small inequality
Related Questions in RECURRENCE-RELATIONS
- Recurrence Relation for Towers of Hanoi
- Solve recurrence equation: $a_{n}=(n-1)(a_{n-1}+a_{n-2})$
- General way to solve linear recursive questions
- Approximate x+1 without addition and logarithms
- Recurrence relation of the series
- first order inhomogeneous linear difference equation general solution
- Guess formula for sequence in FriCAS
- Solve the following recurrence relation: $a_{n}=10a_{n-2}$
- Find closed form for $a_n=2\frac{n-1}{n}a_{n-1}-2\frac{n-2}{n}a_{n-2}$ for all $n \ge 3$
- Young Tableaux generating function
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
geometry
circles
algebraic-number-theory
functions
real-analysis
elementary-set-theory
proof-verification
proof-writing
number-theory
elementary-number-theory
puzzle
game-theory
calculus
multivariable-calculus
partial-derivative
complex-analysis
logic
set-theory
second-order-logic
homotopy-theory
winding-number
ordinary-differential-equations
numerical-methods
derivatives
integration
definite-integrals
probability
limits
sequences-and-series
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Note that sequence $\{a_n, ~ n\in \mathbb{N}\}$ is non-decreasing (because RHS can't be negative, if $a_n\in \mathbb{R}$).
First, let's consider increasing sequence $\{a_n, ~ n\in \mathbb{N}\}$: $$ a_{n+1}>a_n.\tag{1} $$
1. Let's show that there is other (easy) recurrent relation $$ a_n = 6a_{n-1}-a_{n-2}, \qquad (n\geqslant 3),\tag{2} $$ where $a_1=1,a_2=3$. So, we'll have integer sequence $$ 1,~~ 3,~~ 17,~~ 99,~~ 577,~~ 3363,~~ 19601,~~ \ldots\tag{3} $$
It is easy to see that $a_2$ can be $1$ either $3$ (as solution of quadratic equation). We'll consider case $a_2=3$ here, because case $a_2=1$ doesn't hold ineq. $(1)$.
Denote $b_n = \sqrt{\dfrac{a_n^2-1}{2}}$ . Then $$ a_{n+1}-a_n = b_{n+1}+b_n,\qquad (n\in \mathbb{N}),\tag{4} $$
and also $a_{n+1}-a_n = \sqrt{\dfrac{a_{n+1}^2-1}{2}}+b_n$.
Now we'll find $a_{n+1}$ as expression of $a_n, b_n$. Denote $\color{purple}{x} = a_{n+1}$.
$$\color{purple}{x}-a_n = \sqrt{\dfrac{\color{purple}{x}^2-1}{2}} + b_n;$$
$$\color{purple}{x}-(a_n+b_n) = \sqrt{\dfrac{\color{purple}{x}^2-1}{2}}; ~~~~~ (\color{purple}{x}\geqslant a_n+b_n);\tag{5}$$
$$2\Bigl(\color{purple}{x}^2-2(a_n+b_n)\color{purple}{x} +(a_n+b_n)^2\Bigr)= \color{purple}{x}^2-1.$$
$$\color{purple}{x}^2-4(a_n+b_n)\color{purple}{x} +2(a_n+b_n)^2+1= 0.$$ Solving this quadratic equation, we find $2$ solutions:
$a_{n+1} = \color{purple}{x} = a_n$; (but this value doesn't hold ineq. $(1)$, and holds $(5)$ when $b_n=0$ only);
$a_{n+1} = \color{purple}{x} =3a_n+4b_n$.
We will focus on the last expression: $$a_{n+1} = 3a_n + 4b_n, \qquad (n\in \mathbb{N}).\tag{6}$$
$(4),(6)\implies$ $$b_{n+1} = a_{n+1}-(a_n+b_n) = 2a_n+3b_n, \qquad (n\in \mathbb{N}).\tag{7}$$ $(6),(7)\implies$
$$a_{n+1} = 3(3a_{n-1} + 4b_{n-1}) +4(2a_{n-1}+3b_{n-1}) = 17a_{n-1} + 24b_{n-1}, \qquad (n\geqslant 2);$$
$$a_{n+1} = (18a_{n-1} + 24b_{n-1}) -a_{n-1} = 6(3a_{n-1} + 4b_{n-1}) -a_{n-1} = 6a_n-a_{n-1},\qquad (n\geqslant 2).$$
Statement $(2)$ is proved.
2. Since $a_{n-2}<a_{n-1}$ (see $(1)$), then $$ a_n > 5a_{n-1}, \qquad (n\geqslant 3), $$ other words $$ a_n > 3 \cdot 5^{n-2}, \qquad (n\geqslant 3).\tag{8} $$
3. Then $$ \sum_{n=1}^\infty \dfrac{1}{a_n} < 1+\dfrac{1}{3} + \sum_{n=3}^\infty \dfrac{1}{3\cdot 5^{n-2}} = 1+\dfrac{1}{3} + \dfrac{1}{12} = \dfrac{17}{12} <2<e.\tag{9} $$ Bound $\dfrac{17}{12} = 1+\dfrac{5}{12}$ is more sharp estimation than $e$.
I missed the case, when can be $a_{n+1} = a_n$ (non-decreasing sequence). It can be when $b_{n+1}=b_n=0$ (see $(4)$), other words $a_{n+1}=a_n=1$.
So, if we will consider $a_2=a_1$, then, as Don Antonio noted in comments, it generates constant sequence $1,1,1,1,\ldots$. For this sequence we will have $\sum\limits_{n=1}^\infty \dfrac{1}{a_n} = \sum\limits_{n=1}^\infty 1~~$ (divergent series).