Series inequality induction proof

Click For Summary
The discussion revolves around proving the inequality involving the sum of squares, specifically that 1 + 2^2 + 3^2 + ... + n^2 > (1/3) n^3. The initial attempt at an inductive proof was found to be inconsistent, prompting a request for guidance on a better method. Participants suggest using the formula for the sum of squares, which is (1/6)n(n+1)(2n+1), as a more straightforward approach. Clarifications are sought regarding the original problem statement, particularly the exponents used in the terms. The conversation emphasizes the need for a clear and correct formulation of the problem before proceeding with the proof.
Aristarchus_
Messages
95
Reaction score
7
Homework Statement
How do I show that ##1+2^{2} + 3^{3} +...+n^{2} > \frac {1}{3} \cdot n^{3}## ?
Relevant Equations
k
My first attempt was ##... + n^{2} + (n+1)^{2} > \frac {1}{3} n^{3} + (n+1)^{2}##
then we must show that ##\frac {1}{3} n^{3} + (n+1)^{2} > \frac {1}{3} (n+1)^{3}##

We evaluate both sides and see that the LHS is indeed bigger than RHS. However, this solution is inconsistent so I am asking for some guidance as to a better method...
 
Physics news on Phys.org
What you have done does not look right as an attempt at an inductive proof.

Please make a genuine attempt at a proof by induction.
 
Is there a typo in your statement of the problem? In ##1+2^2+3^3+...+n^2##, I fail to see a pattern in the exponents. Is ##3^3## correct? Is ##n^2## correct?
 
Aristarchus_ said:
Homework Statement:: How do I show that ##1+2^{2} + 3^{3} +...+n^{2} > \frac {1}{3} \cdot n^{3}## ?
Relevant Equations:: k

My first attempt was ##... + n^{2} + (n+1)^{2} > \frac {1}{3} n^{3} + (n+1)^{2}##
then we must show that ##\frac {1}{3} n^{3} + (n+1)^{2} > \frac {1}{3} (n+1)^{3}##

We evaluate both sides and see that the LHS is indeed bigger than RHS. However, this solution is inconsistent so I am asking for some guidance as to a better method...

Assuming you mean <br /> 1+2^{2} + 3^{2} + \dots +n^{2} &gt; \frac {1}{3} n^{3}<br /> I would use <br /> 1 + 2^2 + 3^2 + \dots + n^2 = \tfrac16n(n+1)(2n+1). But if I was required to prove that result rather than just state it, then I would prefer your approach since it requires slightly less work.
 
Aristarchus_ said:
We evaluate both sides and see that the LHS is indeed bigger than RHS. However, this solution is inconsistent so I am asking for some guidance as to a better method...
What do you mean by the solution is inconsistent?
 
First, I tried to show that ##f_n## converges uniformly on ##[0,2\pi]##, which is true since ##f_n \rightarrow 0## for ##n \rightarrow \infty## and ##\sigma_n=\mathrm{sup}\left| \frac{\sin\left(\frac{n^2}{n+\frac 15}x\right)}{n^{x^2-3x+3}} \right| \leq \frac{1}{|n^{x^2-3x+3}|} \leq \frac{1}{n^{\frac 34}}\rightarrow 0##. I can't use neither Leibnitz's test nor Abel's test. For Dirichlet's test I would need to show, that ##\sin\left(\frac{n^2}{n+\frac 15}x \right)## has partialy bounded sums...

Similar threads