MHB Induction for series of squares

AI Thread Summary
The discussion focuses on proving the formula for the sum of the squares of the first n odd numbers, specifically that 1^2 + 3^2 + ... + (2n-1)^2 equals (4n^3 - n) / 3. The base case for n=1 is verified, confirming the formula holds true. The inductive step assumes the formula is valid for k and then demonstrates it for k+1 by adding the next odd square, (2k + 1)^2. The calculations show that the expression simplifies correctly to match the formula for n = k + 1. This proof by induction successfully establishes the validity of the formula for all natural numbers n.
KOO
Messages
19
Reaction score
0
Prove that for all nEN

1^2 + 3^2 + 5^2 + ... + (2n-1)^2 = (4n^3 - n) / 3My Solution)


If n = 1, 4(1)^3 - 1 / 3 = 1 so base case holds.

Assume 1^2 + 3^2 + ... + (2k-1)^2 = (4k^3 - k) / 3

What next?
 
Physics news on Phys.org
Well, then, obviously:

$1^2 + 3^2 + 5^2 + \cdots + (2k - 1)^2 + (2k + 1)^2 = \dfrac{4k^3 - k}{3} + (2k + 1)^2$

$= \dfrac{4k^3 - k}{3} + \dfrac{12k^2 + 12k + 3}{3}$

$= \dfrac{4k^3 + 12k^2 + 12k + 4 - k - 1}{3}$

$= \dfrac{4(k+1)^3 - (k+1)}{3}$
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...

Similar threads

Replies
3
Views
5K
Replies
5
Views
2K
Replies
4
Views
1K
Replies
1
Views
2K
Replies
5
Views
4K
Replies
2
Views
3K
Replies
6
Views
2K
Back
Top