1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Induction question

  1. Oct 12, 2009 #1
    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. jcsd
  3. Oct 12, 2009 #2
    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.
     
  4. Oct 13, 2009 #3
    I guess you ought to mention the equation satisfy for n=1 .
    This is important as 1 is the first pst integer.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Induction question
Loading...