Summary of "Discrete Math - 1.7.1 Direct Proof"

Summary of “Discrete Math - 1.7.1 Direct Proof”

This video explains the method of direct proof in discrete mathematics, focusing on how to formally and informally prove implications of the form “if ( P ) then ( Q ).”


Main Ideas and Concepts


Important Definitions Used in Proofs


Example 1: Prove “If ( n ) is odd, then ( n^2 ) is odd”

Proof Steps:

  1. Assume ( n ) is odd, so [ n = 2k + 1 ] for some integer ( k ).

  2. Square both sides: [ n^2 = (2k + 1)^2 = 4k^2 + 4k + 1 ]

  3. Factor out 2 from the first two terms: [ n^2 = 2(2k^2 + 2k) + 1 ]

  4. Since ( 2k^2 + 2k ) is an integer (call it ( r )), rewrite as: [ n^2 = 2r + 1 ]

  5. This matches the definition of an odd integer, so ( n^2 ) is odd.

Conclusion: Therefore, ( n^2 ) is odd. (\quad \square)


Example 2: Prove “The sum of two even integers is even”

Proof Steps:

  1. Express the statement as an implication: If ( A ) and ( B ) are even integers, then ( A + B ) is even.

  2. Assume ( A ) and ( B ) are even: [ A = 2k, \quad B = 2m ] where ( k, m ) are integers.

  3. Add the two: [ A + B = 2k + 2m = 2(k + m) ]

  4. Since ( k + m ) is an integer (call it ( r )), rewrite as: [ A + B = 2r ]

  5. This matches the definition of an even integer, so the sum is even.

Conclusion: Therefore, ( A + B ) is even. (\quad \square)


Additional Notes


Speakers / Sources Featured

Category ?

Educational

Share this summary

Video