homework help > math > other math q&a board > topic: elementary number theory question...

Q BgQuestion:

      
Novice
Karma Points: 29
Respect (100%):
posted by  Etherena on 9/9/2009 5:02:32 PM  |  status: Closed  |  Earned Karma: 29

Elementary Number Theory Question

Course Textbook Chapter Problem Needs by
Other Elementary Number Theory and its applications., ed 5, Kenneth H. Rosen. 1 Section 3, #6 9/10/2009 at 5:00:00 PM
Question Details:
In mathematical induction, when doing the inductive step do you just plug in n+1 for n and then play with it algabraically until it matches what we're trying to prove? or is that statement too concise? please answer and use this as an example if possible :)
Use Mathematical induction to prove that Σ from J=1 to n of J = 1+2+3+...+n = n(n+1)/2.
Bonus Point Alert! Earn +2 additional karma points for helping this gold member.

AAnswers:

Answer Question Ask for clarification
(SME)
posted by ADAM74 on 9/10/2009 12:49:29 AM  |  status: Live
Asker's Rating: Lifesaver   
Response Details:
Oracle
Karma Points: 30,644
posted by Kingle on 9/10/2009 6:54:23 PM  |  status: Live
Asker's Rating: Lifesaver   
Response Details:
 for n = 1
   so true for n = 1
Assume that is true for upto some n, then true for n + 1
We want to show that
 
          by the Induction Hypothesis
        
        
         
So we have shown that
So, by the First Principle of Mathematical Induction  for all values of n
Answer Question Ask for clarificarion
Ask New Question

Join Cramster's Community

Cramster.com brings together students, educators and subject enthusiasts in an online study community. With around-the-clock expert help and a community of over 100,000 knowledgeable members, you can find the help you need, whenever you need it. Join for free today » How Cramster is different from tutoring »

Need Help In

Useful Links