MATH 61 Midterm: MATH 61 Exam 1
Document Summary
Midterm 1 review (test on 20 october 2008) Induction is a method of proof which can often be used for problems that you want to show that some- thing is true for each n n0 (or in other words for n su ciently large). The key method for every induc- tion problem is to identify how the current case can be related back to the previous case(s). Induction proofs are done in two steps: prove the base case(s), assuming it is true for k n show that it must also be true for n + 1. Show that for every n 24 you can always but n pounds of rice. Sets are a collection of objects (called elements). While the objects can be anything we usually will only work with numbers. The order that we list the ele- ments in a set is not important. Let x, y be sets and y denote some element.
