1. ## Simple Induction Problem

Prove by induction that, for all $n \in N$:

$1^3 + 3^3 + 5^3 + ... + (2n - 1)^3 = n^2(2n^2 - 1).$

Prove for $n=1$:

LHS, $1^3 = 1$
RHS, $1^2(2-1)=1$

True for $n=1$, now assume for $n=k$,

$1^3 + 3^3 + 5^3 + ... + (2k - 1)^3 = k^2(2k^2 - 1)$

Now the sequence above is for add numbers, assuming that $k$ is odd, then instead of using $n=k+1$ use $n=k+2$.

We then have:

$1^3 + 3^3 + 5^3 + ... + (2(k+2) - 1)^2$

$1^3 + 3^3 + 5^3 + ... + (2k+4 - 1)^2$

$1^3 + 3^3 + 5^3 + ... + (2k+3)^2$.

Not sure where to go from here? Any help would be great.

Thank you

2. Originally Posted by craig
Prove by induction that, for all $n \subset N$:

$1^3 + 3^3 + 5^3 + ... + (2n - 1)^3 = n^2(2n^2 - 1).$

Prove for $n=1$:

LHS, $1^3 = 1$
RHS, $1^2(2-1)=1$

True for $n=1$, now assume for $n=k$,

$1^3 + 3^3 + 5^3 + ... + (2k - 1)^3 = k^2(2k^2 - 1)$

Now the sequence above is for add numbers, assuming that $k$ is odd, then instead of using $n=k+1$ use $n=k+2$.

We then have:

$1^3 + 3^3 + 5^3 + ... + (2(k+2) - 1)^2$

$1^3 + 3^3 + 5^3 + ... + (2k+4 - 1)^2$

$1^3 + 3^3 + 5^3 + ... + (2k+3)^2$.

Not sure where to go from here? Any help would be great.

Thank you
I think the error is in your reasoning for this step:
Now the sequence above is for add numbers, assuming that is odd, then instead of using use .

even for n=k+1 you will get an odd number. 2k-1 is always odd

else i think the problem should be trivial (i hvn't tried it, but doesn't look too tough)

3. Originally Posted by aman_cc
even for n=k+1 you will get an odd number. 2k-1 is always odd

else i think the problem should be trivial (i hvn't tried it, but doesn't look too tough)
I wouldn't for n=k+1, but I see what you mean by using 2k-1, I'll let you know how it goes

4. Have no idea how to do this, it can't be this hard can it haha?

Using $n=2k-1$

$1^3 + 3^3 + 5^3 + ... + (2n - 1)^3 + (2(2k-1)-1)^3$

$1^3 + 3^3 + 5^3 + ... + (2n - 1)^3 + (4k-2-1)^3$

$1^3 + 3^3 + 5^3 + ... + (2n - 1)^3 + (4k-3)^3$

Any pointers would be appreciated

5. Could you write again carefully your induction hypothesis and what you need to prove? I recommend using k (or n) for the IH, like you did in the first post. Then replace k with k+1 to get what you need to prove.

6. Originally Posted by emakarov
Could you write again carefully your induction hypothesis and what you need to prove? I recommend using k (or n) for the IH, like you did in the first post. Then replace k with k+1 to get what you need to prove.
I proved the result was true for n=1

Originally Posted by craig
Prove for $n=1$:

LHS, $1^3 = 1$
RHS, $1^2(2-1)=1$
Inductive hypothesis, assume true for $n=k$

Originally Posted by craig
True for $n=1$, now assume for $n=k$,

$1^3 + 3^3 + 5^3 + ... + (2k - 1)^3 = k^2(2k^2 - 1)$
The question only involves odd numbers, so wouldn't using $n=k+1$ result in an add number?

7. It does not really matter if you noticed or not that it's the sum of cubes of odd numbers. This problem is solved in a completely general way. The problem asks to prove "For all $n\in\mathbb{N}$, $P(n)$", where $P(n)$ is a property of $n$; in this case an equality that contains $n$. The base case is to show $P(1)$, which you have already done. For the induction step, the induction hypothesis is $P(k)$. What you need to show is $P(k+1)$. It makes things much clearer if $P(k)$ and $P(k+1)$ are written explicitly. Note that $P(k+1)$ is obtained from $P(k)$ by replacing $k$ with $k+1$.

8. Thankyou!

Using $n=k+1$, this gives us:

$(1^3 + 3^3 + ... + (2k-1)^3) + (2(k+1)-1)^3$

$(k^2(2k^2-1) + (2k+)^3$

Expanding out the brackets gives us the following quartic:

$2k^4+8k^3+11k^2+6k+1$

Which factorises to give:

$(k+1)^2(2(k+1)^2-1)$

Therefore proof holds for $k+1$ if true for $k$.

Thanks for all the help