Search the courses, subjects, tracks, games and features, or jump straight to a page.
3 cards from this section. Quick, good the night before a test.
What is the base case in proof by induction?
Think about the smallest natural number applicable.
What does the inductive hypothesis assume?
Consider what you need to prove next.
What is the first step in proof by induction?
Think about where you start before building upon your argument.
True or False: The inductive hypothesis is the part of the proof where we assume the statement is true for k.
Consider what is required to build upon your assumption.
Prove that the formula for the sum of the first n odd numbers is n^2 using induction.
Focus on the algebraic manipulation of odd numbers.
Show that for any integer n >= 1, 2^n - 1 is divisible by n.
Factorize and explore the properties of exponential numbers.
4 more questions in this section. Enroll free to practise them all.
Enroll free