The sum of the squares of the first n odd natural numbers
Posted January 10th, 2008 by Structure
What is the sum of the squares of the first n odd natural numbers?
The answer is:
![]() |
Proof 1:
We will use what we know from this:
The sum of the squares of the first n natural numbers
Let
![]() |
We have
![]() |
We want to find
![]() |
![]() |
![]() |
Proof 2 - Induction proof
1) For n = 1 it's true.
2) Let's consider that is true for n, and let's prove it for n+1.
![]() |
![]() |








Comments
The induction Proof
Dear Structure,
You started the proof with n=1; this implies that n-1=0.
You then assumed n=n, implying that n-n=0. n-n=0 is true but in this case it conveys no useful information.
It would have been better at this stage to assume n=k, (k different from 1) then proceed to show for n+1= k+1 because n+1=k+1 implies n=k or n-k=0.
Agreed?
MOE
Missing parentheses?
Hi,
Shouldn't the last terms of S(2n, 2) read (2n)^2 instead of 2n^2 ? Same comment then applies to 2nd line of "We want to find section".
Otherwise I don't see how you can factor out the 4 to get 4 * S(n, 2)
Best regards.
Thanks for your comments
We shall correct the errors.
Best regards