Math 210

Exam #3 review

Caveat:  Although I try to be comprehensive in these exam reviews, please understand that you are responsible for the material covered since the last exam.  If you notice something that I have missed, please do let me know.

The third hour exam will be Friday, April 8 and will cover sections 2.3 - 4.1 (simple or "weak" induction).  In your review look over assigned problems and definitions.  In particular, be able to

• Provide details of the RSA algorithm
• Construct truth tables and associated digital circuitry diagrams.
• Know the basic identities of logic (DeMorgan's laws, etc.)
• be able to write and identify converses, contrapositives, sufficient and necessary conditions, etc.
• Be able to translate simple English language statements into statements in the propositional and predicate logic
• Know the rules for quantifiers (negation, etc.)
• Know the basic proof techniques, including:
• Modus Ponens
• Modus Tolens
• Proof by contrapositive
• Proof by contradiction
• Proof by cases
• Proof by mathematical induction (for this test, we will only use simple ("weak") mathematical induction.  Strong and Structural induction will be left for the next exam)
• Construct proofs using (weak) mathematical induction

Any questions?  Please ask!  - Bob