Search the courses, subjects, tracks, games and features, or jump straight to a page.
4 cards from this section. Quick, good the night before a test.
Define proof by induction in your own words.
Think about how it serves as a mechanism to establish truth across an infinite set.
What must be shown in the base case of an induction proof?
Consider the first number in the sequence you're working with.
What is the first step in proof by induction?
Remember, without a strong foundation, the rest doesn't stand.
In strong induction, which series of assumptions can you use?
Think about how many cases are at your disposal!
Prove that for any integer n ≥ 1, n^3 - n is divisible by 6.
Focus on how n^3 and n can be restructured in forms conducive to divisibility.
Using strong induction, prove that any integer n ≥ 12 can be expressed as a sum of 4s and 5s.
Consider how the addition of either a 4 or 5 affects the total in constructing k + 1.
5 more questions in this section. Enroll free to practise them all.
Enroll free