There are four steps for mathematical induction: first, show your equation is true for the case n = 1, so we plug in 1 for n and show that the inequality is true. Next, we write an assumption that the statement is also true for the kth term, which means substituting k's for all of the n's. Third, we show that the statement is true for the "k + 1"th term, which means adding one to all of the k's in the assumption and then simplifying. Showing that the statement is true for "k + 1 " terms is sufficient to prove that it is true for all values of n.
Transcript Coming Soon!
Please enter your name.
Are you sure you want to delete this comment?
Experience the 'A-Ha!' moment with the best teachers
whom we hand-picked for you!
M.A. in Secondary Mathematics, Stanford University B.S., Stanford University
Alissa has a quirky sense of humor and a relatable personality that make it easy for students to pay attention and understand the material. She has all the math tips and tricks students are looking for.
“Your tutorials are good and you have a personality as well. I hope you have more advanced college level stuff, because I like the way you teach.”
“Thanks alot for such great lectures... I never found learning this easier ever before... keep up the great work.... :)”
“You seem so kind, it's awesome. Easier to learn from people who seem to be rooting for ya!' thanks”