Upgrade to Pro — share decks privately, control downloads, hide ads and more …

Class 12

Mohammad Mahmoody
September 29, 2017

Class 12

Discrete Math

Mohammad Mahmoody

September 29, 2017

Transcript

23 slides
  1. Plan 1. Strong Induction 2. Review: • Proof methods •

    Functions/relations • CNF,DNF,3CNF
  2. Take-Away Game Start with = 16 sticks Each turn: player

    must remove 1, 2, or 3 sticks (Winner is player who takes the last stick)
  3. Prove: Always Ends Theorem. A Take-Away game with any initial

    number of sticks, ∈ ℕ+, ends. Is this proof by induction? Seems similar but still different..
  4. Theorem 2. Player 1 has a winning strategy for a

    Take-Away game with sticks, ∀ ∈ ℕ. ≠ 4. Player 2 has a winning strategy ∀ ∈ ℕ. = 4. Theorem 1 . A Take-Away game with any initial number of sticks, ∈ ℕ+, ends.
  5. They are equally powerful! Each principle implies the other two..

    We keep all 3 of them to use whichever is more convenient.
  6. Proof by contra-positive Recall → is equivalent to ¬ →

    ¬ (check truth table) So, when we want to prove → instead we prove ¬ → ¬ Example: Suppose is a real number. Prove that if is irrational, then √ is also irrational.
  7. Proof by contradiction Example: Proving that is not well ordered.

    Usually useful when we want to prove something like ∀. () or ∀ ¬() (i.e. there is no x P(x))
  8. Example 0: Suppose relation : → has the property that:

    ∀, . ¬() Which properties below must have as well?
  9. Example 1: Suppose relation : → has the property that:

    ∀, 1 , 2 . 1 ∧ 2 → 1 = 2 Which properties below must have as well?
  10. 3CNF Example1: → ↔ Example2: = ∨ ∧ ∨ ∨

    ∨ Write a 3CNF such that is satisfiable if and only if is satisfiable

More Decks by Mohammad Mahmoody

Other Decks in Education