To prove that 132+152+172+⋯+1(2n+1)2<14\frac{1}{3^2} + \frac{1}{5^2} + \frac{1}{7^2} + \cdots +\frac{1}{(2n+1)^2} < \frac{1}{4} 321+521+721+⋯+(2n+1)21<41 for all n belongs to Nn\ belongs\ to\ Nn belongs to N
This was given to be proved by induction in "Self-Learning Exercises - GSEB".
Note by Megh Parikh 7 years, 2 months ago
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
_italics_
**bold**
__bold__
- bulleted- list
1. numbered2. list
paragraph 1paragraph 2
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
This is a quote
# I indented these lines # 4 spaces, and now they show # up as a code block. print "hello world"
\(
\)
\[
\]
2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Overkill: Here ∑\sum∑ indicates ∑i=1∞\sum_{i=1}^\infty∑i=1∞. Since ∑1i2=π26\sum \frac{1}{i^2} = \frac{\pi^2}{6}∑i21=6π2, we have ∑1(2i)2=π224\sum \frac{1}{(2i)^2} = \frac{\pi^2}{24}∑(2i)21=24π2. Subtracting the two, we have ∑1(2i−1)2=π28\sum \frac{1}{(2i-1)^2} = \frac{\pi^2}{8}∑(2i−1)21=8π2, thus ∑1(2i+1)2=∑1(2i−1)2−112=π28−1<14\sum \frac{1}{(2i+1)^2} = \sum \frac{1}{(2i-1)^2} - \frac{1}{1^2} = \frac{\pi^2}{8} - 1 < \frac{1}{4}∑(2i+1)21=∑(2i−1)21−121=8π2−1<41.
I'm pretty sure the method is to figure out some always positive f(n)f(n)f(n) such that f(n)−1(2n+1)2>f(n+1)f(n) - \frac{1}{(2n+1)^2} > f(n+1)f(n)−(2n+1)21>f(n+1), so we can induct it on ∑i=1n1(2i+1)2<14−f(n)\sum_{i=1}^n \frac{1}{(2i+1)^2} < \frac{1}{4} - f(n)∑i=1n(2i+1)21<41−f(n).
Log in to reply
That is indeed an overkill. The problem is direct if you know that fact, and hence lets look for solutions which do not directly involve it.
Any suggestions for what f(n)f(n) f(n) could be?
By guesswork I obtained one f to be f(n)=n+1916(2n+1)2f(n)=\dfrac{n+\frac{19}{16}}{(2n+1)^2}f(n)=(2n+1)2n+1619
Explaining my guesswork:
I assumed f to be rational function with denominator to be (2n+1)^2 and numerator to be linear ax+b
Then I got quadratic in n and made it into linear and got a=1.
Then solving for b in term of n, I got b>9/8
Also f(1)−f(n+1)<1/4 ⟹ b<5/4f(1) - f(n+1) < 1/4 \implies b<5/4f(1)−f(n+1)<1/4⟹b<5/4
So I took b=9.5/8
@Megh Parikh – Nicely done.
Note that the second condition is superfluous, because we can choose a different starting point. For example, if we take b=2 b = 2 b=2, then with g(n)=n+2(2n+1)2 g(n) = \frac{n+2}{(2n+1)^2} g(n)=(2n+1)2n+2, we get that g(n)−g(n+1)>1(2n+1)2 for n≥1. g(n) - g(n+1) > \frac{ 1}{ (2n+1) } ^2 \text{ for } n \geq 1 .g(n)−g(n+1)>(2n+1)12 for n≥1.
It remains to find an nnn which would give us
132+152+…+1(2n+1)2<14−g(n). \frac{1}{3^2 } + \frac{1}{5^2} + \ldots + \frac{1}{(2n+1)^2} < \frac{1}{4} - g(n) .321+521+…+(2n+1)21<41−g(n).
In this particular case, n=5 n = 5 n=5 works (using a calculator).
I didn't understand the subtraction of the summation. How did you get the denominator (2i−1)2{(2i-1)}^2(2i−1)2 ? .Could you explain better this part?
∑1i2=112+122+132+142+…\sum \frac{1}{i^2} = \frac{1}{1^2} + \frac{1}{2^2} + \frac{1}{3^2} + \frac{1}{4^2} + \ldots∑i21=121+221+321+421+…, and ∑1(2i)2=122+142+162+…\sum \frac{1}{(2i)^2} = \frac{1}{2^2} + \frac{1}{4^2} + \frac{1}{6^2} + \ldots∑(2i)21=221+421+621+…, so subtracting the two gives 112+132+152+…=∑1(2i−1)2\frac{1}{1^2} + \frac{1}{3^2} + \frac{1}{5^2} + \ldots = \sum \frac{1}{(2i-1)^2}121+321+521+…=∑(2i−1)21.
Thanks
112+132+152+⋯=(112+122+132+… )−(122+142+162+… )=π26−π24⋅6=π28\frac11^2+\frac13^2+\frac15^2+\dots=\left(\frac11^2+\frac12^2+\frac13^2+\dots\right)-\left(\frac12^2+\frac14^2+\frac16^2+\dots\right)=\frac{\pi^2}{6}-\frac{\pi^2}{4\cdot6}=\frac{\pi^2}{8}112+312+512+⋯=(112+212+312+…)−(212+412+612+…)=6π2−4⋅6π2=8π2
Hence,
132+152+⋯=π28−1<14\frac13^2+\frac15^2+\dots=\frac{\pi^2}{8}-1<\frac14312+512+⋯=8π2−1<41
Since f(n)f(n)f(n) is increasing monotonically and the inequality holds asymptotically, the inequality holds for each nnn.
That is exactly my solution above, which is also an overkill (you have to prove ∑1i2=π26\sum \frac{1}{i^2} = \frac{\pi^2}{6}∑i21=6π2, for example).
Problem Loading...
Note Loading...
Set Loading...
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Overkill: Here ∑ indicates ∑i=1∞. Since ∑i21=6π2, we have ∑(2i)21=24π2. Subtracting the two, we have ∑(2i−1)21=8π2, thus ∑(2i+1)21=∑(2i−1)21−121=8π2−1<41.
I'm pretty sure the method is to figure out some always positive f(n) such that f(n)−(2n+1)21>f(n+1), so we can induct it on ∑i=1n(2i+1)21<41−f(n).
Log in to reply
That is indeed an overkill. The problem is direct if you know that fact, and hence lets look for solutions which do not directly involve it.
Any suggestions for what f(n) could be?
By guesswork I obtained one f to be f(n)=(2n+1)2n+1619
Log in to reply
Explaining my guesswork:
I assumed f to be rational function with denominator to be (2n+1)^2 and numerator to be linear ax+b
Then I got quadratic in n and made it into linear and got a=1.
Then solving for b in term of n, I got b>9/8
Also f(1)−f(n+1)<1/4⟹b<5/4
So I took b=9.5/8
Log in to reply
Note that the second condition is superfluous, because we can choose a different starting point. For example, if we take b=2, then with g(n)=(2n+1)2n+2, we get that g(n)−g(n+1)>(2n+1)12 for n≥1.
It remains to find an n which would give us
321+521+…+(2n+1)21<41−g(n).
In this particular case, n=5 works (using a calculator).
I didn't understand the subtraction of the summation. How did you get the denominator (2i−1)2 ? .Could you explain better this part?
Log in to reply
∑i21=121+221+321+421+…, and ∑(2i)21=221+421+621+…, so subtracting the two gives 121+321+521+…=∑(2i−1)21.
Thanks
112+312+512+⋯=(112+212+312+…)−(212+412+612+…)=6π2−4⋅6π2=8π2
Hence,
312+512+⋯=8π2−1<41
Since f(n) is increasing monotonically and the inequality holds asymptotically, the inequality holds for each n.
Log in to reply
That is exactly my solution above, which is also an overkill (you have to prove ∑i21=6π2, for example).