I need to prove that
$$(1+2+{...}+k)^2 = 1^3 + {...} + k^3$$
using induction.
So the base case holds for $0$ because $0 = 0$ (and also for $1$: $1^2 = 1^3 = 1$)
I can't prove it for $k+1$ no matter what I try! Can you give me a hint?
Friday, 12 February 2016
discrete mathematics - Prove $(1+2+...+k)^2 = 1^3 + ... + k^3$ using induction
Subscribe to:
Post Comments (Atom)
real analysis - How to find $lim_{hrightarrow 0}frac{sin(ha)}{h}$
How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
-
How can one proof the equality $$\sum\limits_{v=0}^k \frac{k^v}{v!}=\sum\limits_{v=0}^k \frac{v^v (k-v)^{k-v}}{v!(k-v)!}$$ for $k\in\mathbb{...
-
Good evening, I have a question concerning the euclidean algorithm. One knows that for $a_1 , \ldots , a_n \in \mathbb{N} $ and $k\in \mathb...
-
Using mathematical induction, I have proved that $$1+ 5+ 9 + \cdots +(4n-3) = 2n^{2} - n$$ for every integer $n > 0$. I would like to kn...
No comments:
Post a Comment