Results 1 to 2 of 2

Math Help - Prove by induction....

  1. #1
    Member
    Joined
    Mar 2008
    Posts
    91

    Prove by induction....

    Prove by induction that every integer can be represented in the form 3n, 3n+1, 3n+2. Never encountered such an induction question.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Grand Panjandrum
    Joined
    Nov 2005
    From
    someplace
    Posts
    14,972
    Thanks
    4
    Quote Originally Posted by ah-bee View Post
    Prove by induction that every integer can be represented in the form 3n, 3n+1, 3n+2. Never encountered such an induction question.
    Base case N=1, this can be writen 3\times 0+1, so the proposition holds for N=1.

    Suppose it true for N=k, then there is an n such that:

    k=3n, or 3n+1 or 2n+3

    Suppose the first of these is the case, then:

    k+1=3n+1 and the proposition holds,

    suppose the second is the case:

    k+1=(3n+1)+1=3n+2, and the proposition holds,

    suppose the third is the case:

    k+1=(3n+2)+1=3(n+1), and the proposition holds.

    Hence the proposition holds for k+1 whatever the case, and the induction goes through

    RonL
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. prove by induction
    Posted in the Advanced Algebra Forum
    Replies: 2
    Last Post: October 23rd 2011, 08:43 AM
  2. Replies: 10
    Last Post: June 29th 2010, 12:10 PM
  3. Prove by induction
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: October 10th 2009, 08:11 AM
  4. PROVE BY INDUCTION
    Posted in the Algebra Forum
    Replies: 7
    Last Post: December 11th 2008, 07:43 AM
  5. Prove by Induction
    Posted in the Calculus Forum
    Replies: 3
    Last Post: October 12th 2007, 10:31 AM

Search Tags


/mathhelpforum @mathhelpforum