Algebra 2 Tutorial
Mathematical induction is a form of proof that takes place in two parts.
It is surprisingly useful.
Part 1) Prove that the statement is true for the number 1.
Part 2) Prove that if it is true for any number n then it is also true for the number n+1.
Think about it… we first show what we want to prove is true for 1.
Using step 2 we know if it’s true for 1 then it is true for 2.
If it is true for 2 then it is true for 3.
If it is true for 3 then it is true for 4.
Et cetera, et cetera, et cetera
The logic goes on forever, so what we want to prove is true for ANY integer.
Let’s prove that
The first part is simple…
Is it true that … Of course it is!
Part 2 is the tricky part.
We take, as an assumption, that
And we show that if this is true then
…. our assumption
… add (n+1) to both sides
… multiply numerator and denominator of (n+1) by 2
Now notice that the two terms on the right hand side each have a common factor of (n+1). We can factor that out and get what we want.
Our proof is complete. We have show that our equation is true when n=1 and we have shown that if it is true for any value n, then it is also true for n+1.
That is to say, our equation is true for all integers.
About The Author
|Math And Physics Expertise|
|I have extensive teaching experience over 40 years: Physics lecturer at LSU Physics teaching assistant at LSU Tutored athletes at UCONN Mentored engineers and technicians at TI, Atmel and IMFT Private tutoring at Cheyenne Mountain High School I have a masters degree i...|