This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Math 374, Exam 2 Information Exam 2 will be based on: • Sections 2.1  2.6, 3.1. • The corresponding assigned homework problems (see http://www.math.sc.edu/ ∼ boylan/SCCourses/374Sp09/374.html) At minimum, you need to understand how to do the homework problems. • Lecture notes: 2/11  3/6. Topic List (not necessarily comprehensive): You will need to know how to define vocabulary words/phrases defined in class. § 2.1 : Proof techniques . These include: • Direct proof . • Contrapositive . To prove P → Q , it suffices to give a direct proof of Q → P , which is the contrapositive of P → Q . • Contradiction . To prove P → Q it suffices to give a direct proof of P ∧ Q → ; here, denotes a contradiction. It is not always clear what the contradiction, , will be when you begin a proof by contradiction. You simply hope to be led to a statement which is clearly false. • Counterexample . To prove that the statement ∀ xP ( x ) is false or simply that the state ment P (...
View
Full Document
 Spring '09
 Boyan
 Mathematical Induction, Recursion, Inductive Reasoning, Mathematical logic, Mathematical proof

Click to edit the document details