lec05-proofs - EECS 203 Winter 2007 Discrete Mathematics...

Info icon This preview shows pages 1–6. Sign up to view the full content.

EECS 203, Winter 2007 Discrete Mathematics Lecture 5 Proofs January 18 Reading: Rosen [1.6] January 18 Proofs, Page 1
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

5.1 Proof methods Direct Proof: to prove a statement ”If p then q .” Start with the hypothesis p , Conclude q . Example: Prove that for any integer n , if n is odd then n 2 is odd. Proof by contraposition: to prove ”If p then q .” Start with the hypothesis ¬ q , Conclude ¬ p . Example: Prove that for any integer n , if n 2 is odd then n is odd. January 18 Proofs, Page 2
Image of page 2
5.1 Proof methods Proof by contradiction: to prove a statement p , Assuming for the purpose of getting a contradiction ¬ p , Obtain a contradiction, Conclude p . Example: Prove that there are infinite number of primes. January 18 Proofs, Page 3
Image of page 3

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

5.1 Proof methods Proof by cases: to prove ” xp ( x ) . ”, Partition the range of x to several cases and prove the statement for each case. Example: Prove that for any integer n , n ( n + 1) is even. Proof by construction: to prove ” xp ( x )”. Construct a specific
Image of page 4
Image of page 5

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: x such that p ( x ) is true. Example: Prove that the following is not valid first-order formula: ∃ x ( φ-→ ψ )-→ (( ∃ xφ )-→ ( ∃ ψ )) . January 18 Proofs, Page 4 5.1 Proof methods Proof by induction: to prove “For any integer n ≥ 0, P ( n ).” • Prove that P (0) is true. • Prove that for any integer i ≥ 0, P ( i )-→ P ( i + 1). • Conclude that P ( n ) is true for all n ≥ 0. Correctness: by axiom of natural numbers. Example: Prove that for any n ≥ 0, 0 + 1 + 2 + ··· + n = n ( n + 1) / 2. Prove that 2 b ≥ n 2 for all n ≥ 4. January 18 Proofs, Page 5 5.2 Proofs that go wrong . Mistaken : • To prove p : we know p-→ q and q , therefore, p . • To prove ∀ xP ( x ): here are examples of x that P ( x ) is true, thus P ( x ) must be true for all x . January 18 Proofs, Page 6...
View Full Document

  • Winter '07
  • YaoyunShi
  • Mathematical proof, Proof methods Proof

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern