CTK Exchange
Front Page
Movie shortcuts
Personal info
Awards
Reciprocal links
Terms of use
Privacy Policy

Interactive Activities

Cut The Knot!
MSET99 Talk
Games & Puzzles
Arithmetic/Algebra
Geometry
Probability
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
My Logo
Math Poll
Other Math sit's
Guest book
News sit's

Recommend this site

Manifesto: what CTK is about Search CTK Buying a book is a commitment to learning Table of content Products to download and subscription Things you can find on CTK Chronology of updates Email to Cut The Knot Recommend this page

CTK Exchange

Subject: "Incredibly lost in Mathematical Induction"     Previous Topic | Next Topic
Printer-friendly copy     Email this topic to a friend    
Conferences The CTK Exchange College math Topic #616
Reading Topic #616
Cory H
guest
May-01-07, 07:21 PM (EST)
 
"Incredibly lost in Mathematical Induction"
 
   ok so I feel completely stupid about this, but I am far beyond conventionally lost. I have two questions (at least one of them using Mathematical Induction - the other I'm not too sure of) that I'm completely lost on - have tried looking around online for answers to these questions, but I have unfortunately been unable to relate my findings to these particular equations. SO - if anyone could help me in describing and step-by-step explanations on how to work these two problems, I'd be indebted:

1.Prove that the square of any odd integer has the form 8m + 1 for some integer m.

2.Prove the following statement by mathematical induction:

Thank you So much, again, for any help on these


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
alexbadmin
Charter Member
2000 posts
May-07-07, 06:03 PM (EST)
Click to EMail alexb Click to send private message to alexb Click to view user profileClick to add this user to your buddy list  
1. "RE: Incredibly lost in Mathematical Induction"
In response to message #0
 
   1. An odd number is of the form 2n + 1 which, when squared, gives




(2n + 1)2= 4n2 + 4n + 1
 4n(n + 1) + 1.

Note that in n(n + 1) the factors are two consecutive integers, of which one is necessarily even. Therefore

n(n + 1) = 2m, for some m.

Combining gives

(2n + 1)2 = 8m + 1.

2. The induction in this example is so standard, it is probably contained in any book where math induction is mentioned.
2


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top

Conferences | Forums | Topics | Previous Topic | Next Topic

You may be curious to have a look at the old CTK Exchange archive.
Please do not post there.

Copyright © 1996-2018 Alexander Bogomolny

Search:
Keywords:

Google
Web CTK