Scribd
Upload
19 views2 pages

Algorithm

The document discusses different proof strategies including case analysis, contradiction, contrapositive, construction, and induction. It provides examples for each strategy. It also discusses how to disprove statements by proving their negation, either through construction of a counterexample or showing something is true for all cases.

Uploaded by

Chan David
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
19 views2 pages

Algorithm

The document discusses different proof strategies including case analysis, contradiction, contrapositive, construction, and induction. It provides examples for each strategy. It also discusses how to disprove statements by proving their negation, either through construction of a counterexample or showing something is true for all cases.

Uploaded by

Chan David
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Notes, 1(c)

ECE 606

Dis/proof strategies
All our strategies are based on logical deduction.
Strategies:
• Case analysis

For x, y, z ∈ N with x + y = z, if any two of x, y, z is divisible by 3, then so


is the third.

• Contradiction: focus on only row of truth-table for which p =⇒ q is false.


√
x = 2 =⇒ x 6∈ Q

• Contrapositive: p =⇒ q ≡ ¬q =⇒ ¬p.
y
x
!
X X
Given x, y ∈ Z+ , i= i =⇒ (x = y)
i=1 i=1

– Note: contrapositive is not the same as converse. The converse of p =⇒ q is


q =⇒ p.

• Construction: for statements of the form ∃x . . .

Given x, y ∈ R with x < y, ∃z ∈ R, x < z < y.

• Induction
n(n+1)(2n+1)
– 12 + 22 + . . . + n2 = 6
k−1
X
– Suppose n ∈ N whose digits are nk−1 nk−2 . . . n0 . If ni is divisible by 3, then
i=0
n is divisible by 3.

1
To disprove a statement S, we prove it’s negation, ¬S.
• ¬(∀n ∈ N, n2 − n + 11 is prime) ≡ ∃n ∈ N, n2 − n + 11 is not prime.
Can prove this by construction, i.e., a “counterexample.”

• Suppose P is the set of all primes, i.e., P = {2, 3, 5, 7, . . .}.


¬(∃p, q ∈ P, p − q = 513) ≡ ∀p, q ∈ P, p − q 6= 513.

You might also like