# Induction question

1. Oct 12, 2009

### zeion

1. The problem statement, all variables and given/known data

Show that the statement holds for all positive integers n.

1 + 3 + 5 + ... + (2n -1) = n2

2. Relevant equations

3. The attempt at a solution

Assume that k will work, then k + 1:

1 + 3 + 5 + ... + (2(k+1) -1) = (k+1)2
1 + 3 + 5 + ... + 2k+1 = k2 + 2k + 1

Recall that for k,
1 + 3 + 5 + ... + (2k -1) = k2

Then k+1,
1 + 3 + 5 + ... + (2k -1) + (2k+1) = k2 + (2k + 1)

Is this enough to conclude that the statement holds?

2. Oct 12, 2009

### n!kofeyn

Yes, that is correct. I would just be a little careful in your wording and progression of statements. I know that you are working backwards so to speak, but from appearances, it looks like you are assuming what you are trying to prove. When doing induction, try to be as strict and algorithmic as possible. Make sure each statement follows directly from the one preceding it.

3. Oct 13, 2009

### icystrike

I guess you ought to mention the equation satisfy for n=1 .
This is important as 1 is the first pst integer.
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}