MHB Find the smallest A satisfying the inequality

  • Thread starter Thread starter lfdahl
  • Start date Start date
  • Tags Tags
    Inequality
lfdahl
Gold Member
MHB
Messages
747
Reaction score
0
Let $a_1 = 1$, $a_2 = 1$ and $a_n = a_{n-1}+a_{n-2}$ for each $n > 2$. Find the smallest real number, $A$, satisfying

\[\sum_{i = 1}^{k}\frac{1}{a_{i}a_{i+2}} \leq A\]

for any natural number $k$.
 
Mathematics news on Phys.org
lfdahl said:
Let $a_1 = 1$, $a_2 = 1$ and $a_n = a_{n-1}+a_{n-2}$ for each $n > 2$. Find the smallest real number, $A$, satisfying

\[\sum_{i = 1}^{k}\frac{1}{a_{i}a_{i+2}} \leq A\]

for any natural number $k$.

we have
$\frac{1}{a_{i}a_{i+2}}= \frac{1}{a_{i+1}}\frac{a_{i+1}}{a_{i}a_{i+2}}$
$= \frac{1}{a_{i+1}}\frac{a_{i+2}- a_i}{a_{i}a_{i+2}}$ (from given condition)
$= \frac{1}{a_{i+1}}(\frac{1}{a_i} - \frac{1} {a_{i+2}})$
above term is positive and telescopic sum so maximum sum is sum at infinite and adding we get
$\frac{1}{a_1a_2} + \frac{1}{a_2a_3}$ and se get putting the values $\frac{3}{2}$
 
kaliprasad said:
we have
$\frac{1}{a_{i}a_{i+2}}= \frac{1}{a_{i+1}}\frac{a_{i+1}}{a_{i}a_{i+2}}$
$= \frac{1}{a_{i+1}}\frac{a_{i+2}- a_i}{a_{i}a_{i+2}}$ (from given condition)
$= \frac{1}{a_{i+1}}(\frac{1}{a_i} - \frac{1} {a_{i+2}})$
above term is positive and telescopic sum so maximum sum is sum at infinite and adding we get
$\frac{1}{a_1a_2} + \frac{1}{a_2a_3}$ and se get putting the values $\frac{3}{2}$

Hi, kaliprasad

With your telescoping sum, I get:
\[\sum_{i=1}^{k}\frac{1}{a_{i}a_{i+2}} = \sum_{i=1}^{k}\left ( \frac{1}{a_{i}a_{i+1}}-\frac{1}{a_{i+1}a_{i+2}} \right )\\ =\frac{1}{a_{1}a_{2}}-\frac{1}{a_2a_3}+\frac{1}{a_2a_3}-...+ \frac{1}{a_{k-1}a_k}-\frac{1}{a_ka_{k+1}}+\frac{1}{a_ka_{k+1}}-\frac{1}{a_{k+1}a_{k+2}} \\ = \frac{1}{a_{1}a_{2}}-\frac{1}{a_{k+1}a_{k+2}} = 1-\frac{1}{a_{k+1}a_{k+2}}.\]

So the smallest possible $A$, that satisfies the inequality is:
\[\lim_{k\rightarrow \infty }\left ( 1-\frac{1}{a_{k+1}a_{k+2}} \right ) = 1.\]
 
lfdahl said:
Hi, kaliprasad

With your telescoping sum, I get:
\[\sum_{i=1}^{k}\frac{1}{a_{i}a_{i+2}} = \sum_{i=1}^{k}\left ( \frac{1}{a_{i}a_{i+1}}-\frac{1}{a_{i+1}a_{i+2}} \right )\\ =\frac{1}{a_{1}a_{2}}-\frac{1}{a_2a_3}+\frac{1}{a_2a_3}-...+ \frac{1}{a_{k-1}a_k}-\frac{1}{a_ka_{k+1}}+\frac{1}{a_ka_{k+1}}-\frac{1}{a_{k+1}a_{k+2}} \\ = \frac{1}{a_{1}a_{2}}-\frac{1}{a_{k+1}a_{k+2}} = 1-\frac{1}{a_{k+1}a_{k+2}}.\]

So the smallest possible $A$, that satisfies the inequality is:
\[\lim_{k\rightarrow \infty }\left ( 1-\frac{1}{a_{k+1}a_{k+2}} \right ) = 1.\]

it is my mistake.
Your telescopic sum and hence limit is right.
 
Last edited by a moderator:
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.
Back
Top