Scribd
Upload
8 views

Discrete Mathematics - Lecture 9

This document introduces various concepts related to mathematical proofs, including: - Types of proofs (formal vs informal) - Basic terminology used in proofs like theorems, lemmas, etc. - Properties of even, odd, prime, composite integers - Conditions for integers/real numbers being divisible, perfect squares, rational - Strategies for directly proving conditional statements - Examples of proofs involving sums, products, and properties of integers It concludes with announcing the relevant chapter and section in the textbook for further reading on this topic.

Uploaded by

talha6901
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

Discrete Mathematics - Lecture 9

This document introduces various concepts related to mathematical proofs, including: - Types of proofs (formal vs informal) - Basic terminology used in proofs like theorems, lemmas, etc. - Properties of even, odd, prime, composite integers - Conditions for integers/real numbers being divisible, perfect squares, rational - Strategies for directly proving conditional statements - Examples of proofs involving sums, products, and properties of integers It concludes with announcing the relevant chapter and section in the textbook for further reading on this topic.

Uploaded by

talha6901
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 23

Instructor: Sulaman Ahmad Naz

 Introduction to PROOFS

 Types of proofs
◦ Formal Proofs
◦ Informal Proofs

 Basic Terminology
◦ Theorem
◦ Lemma
◦ Corollary
◦ Conjecture
◦ Axiom / Postulate
 A PROOF is a valid argument that establishes
the truth of a mathematical statement.
 Formal Proofs
◦ All steps are provided
◦ One rule used at a time
◦ Rules for each step are stated
 Informal Proofs
◦ Some steps may be skipped
◦ More than one rule can be used at a step
◦ Some axioms are assumed
◦ Rules not explicitly stated
 An integer n can be even if and only if 2 is
one of its factors.
◦ i.e. n=2 * k

 An integer n can be odd if and only if


n=2 * k + 1 OR n=2*k–1

Here, k represents some integer.


 An integer n is prime if and only if it has only
two factors; one of them is 1.
◦ i.e. if n=r.s; then r = 1 or s = 1

 An integer n is composite if and only if it has


at least a pair of factors such that none of
them is 1.
◦ i.e. if n=r.s; then r ≠ 1 and s ≠ 1

Let r and s represents some positive integer.


 An integer n is divisible by d if and only if
n=d.k for some integer k and d ≠ 0.

 An integer n is perfect square if and only if


n=k2 for some integer k.

 A real number r is rational only if r= and


b≠0.
 In order to directly prove a conditional
statement of the form "If p, then q", it is
sufficient to consider the situations in which
the statement p is true.
 The implication p →q can be proved by
showing that if p is true, then q must also be
true.
 This shows that the combination p true and q
false never occurs.

No need to consider where


p=FALSE
 Prove that the sum of two odd integers is
even.
 Prove that if n is any even integer, then(-1)n=1.
 Prove that the product of an even integer and
an odd integer is even.
 Prove that the square of an even integer is
even.
 Prove that if n is an odd integer, then n3 + n
is even.
 Prove that, if the sum of any two integers is
even, then so is their difference.
 Prove that the sum of any two rational
numbers is rational.
 Given any two distinct rational numbers r and
s with r < s. Prove that there is a rational
number x such that r < x < s.
 Prove that the sum of any three consecutive
integers is divisible by 3.
 Prove the statement: There are real numbers
a and b such that
 Chapter 1

◦ Section 1.7

 Page 81 – 83
 End of Lecture
 Q/A

You might also like