0% found this document useful (0 votes)
6 views

intro_post_lecture sept 1.1

The document discusses the importance of discrete mathematics in fields such as computer science, mathematics, and statistics, emphasizing its applications in artificial intelligence, cryptography, and programming languages. It introduces mathematical reasoning and proofs, illustrating how to logically derive truths about mathematical statements. The course aims to deepen understanding of mathematical concepts and the validity of proofs, which are essential for success in future mathematics and computer science courses.

Uploaded by

box.office1306
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
0% found this document useful (0 votes)
6 views

intro_post_lecture sept 1.1

The document discusses the importance of discrete mathematics in fields such as computer science, mathematics, and statistics, emphasizing its applications in artificial intelligence, cryptography, and programming languages. It introduces mathematical reasoning and proofs, illustrating how to logically derive truths about mathematical statements. The course aims to deepen understanding of mathematical concepts and the validity of proofs, which are essential for success in future mathematics and computer science courses.

Uploaded by

box.office1306
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/ 15

CSC/MAT A67 – Discrete Mathematics

M. Molloy and A. Tafliovich1

1
based on How To Prove It, by D. Velleman
1
Discrete Mathematics
Why do you need to study discrete mathematics?

Computer Science, Mathematics, and Statistics all need it.


• artificial intelligence and machine learning
• cryptography
• databases
• mathematical proof and reasoning
• networking algorithms
• programming languages
• statistical modelling and analysis
• verification of hardware and software
• and many, many more!
mathematical reasoning
We have all seen a problem like this one:
C
• Given: a triangle △ABC , with right
angle ∠CAB, and 60◦ angle ∠ABC .
• Find: angle ∠ACB.
• Solution: 30◦ .
60◦
A B
Why is this the correct answer?
• I printed the slide and measured the angle with a protractor.
• This is a “special” triangle. I memorised the values.
• In a right triangle, if one angle is 60◦ , the other one is 30◦ .
• In any triangle, the angles add up to 180◦ . Arithmetic rules:
180 − 90 − 60 = 30.
mathematical reasoning
In any triangle, the angles add up to 180◦ .
• How do you know this is true?
• We are talking about all possible triangles!
• While we will not focus on geometry in this course, we will
study techniques that allow us to confidently make strong
statements such as this one.
mathematical reasoning
Other examples:
• Given x 2 − x − 6 = 0. What are the possible values of x?
• Let f (x) = x 2 − x − 6. What is the slope of the line tangent
to this curve at x = 1?
When we are solving these problems, what do we assume to be
true?
mathematical reasoning
Another example that you know from high-school:

c
b
a2 + b 2 = c 2

a
What does this mean?
1. Usually a2 + b 2 is approximately c 2 .
2. a2 + b 2 = c 2 exactly, on every right triangle that anyone has
ever checked.
3. a2 + b 2 = c 2 exactly, on every right triangle that anyone has
ever checked, and we think that it holds exactly on every
other right triangle.
4. We know that a2 + b 2 = c 2 on every right triangle that can
possibly exist. We can guarantee that nobody will ever find a
right triangle where this is not true.
mathematical reasoning
• So far, most of your math classes have been computational.
• You have been taught methods to compute things, and you
have trusted that those methods work.
• In university, you will dive deeper.
• You will learn how to know that these things work.
• How to know that a mathematical statement is true.

7
mathematical reasoning
Let’s begin with a simple problem.
Every pair of odd integers adds up to an even integer.
We have definitions:
• An even integer can be written as 2x where x is some integer.
• An odd integer can be written as 2x + 1 where x is some
integer.
Proof steps:
1. Take any two odd integers.
2. By definition, they can be written as 2x + 1 and 2y + 1.
3. Using algebraic rules, their sum is
2x + 1 + 2y + 1 = 2x + 2y + 2 = 2(x + y + 1).
4. By definition, this is an even integer.
Q. How did we show that this is true for every possible pair of
odd integers?
A. We used variables. Every statement logically follows from the
previous statements or from known truths.
mathematical reasoning
A slightly more challenging problem:

Suppose n is an integer larger than 1 and n is not prime.


Then 2n − 1 is not prime.

We have a definition:
• A prime number is an integer greater than 1, that is not a
product of two smaller positive integers.
Proof steps:

9
mathematical reasoning
Proof steps:
1. By definition, n = ab, where a and b are positive integers, and
a < n and b < n.
2. Let x = 2b − 1, y = 1 + 2b + 22b + · · · + 2(a−1)b .
3. Then
x · y =(2b − 1) · (1 + 2b + 22b + · · · + 2(a−1)b )
=2b · (1 + 2b + 22b + · · · + 2(a−1)b ) − (1 + 2b + 22b + · · · + 2(a−1)b )
=(2b + 22b + · · · + 2ab ) − (1 + 2b + 22b + · · · + 2(a−1)b )
=2ab − 1
=2n − 1
4. Since b < n, we have x = 2b − 1 < 2n − 1.
Since a < n = ab, we have b > 1 and so
x = 2b − 1 > 21 − 1 = 1. Then y < xy = 2n − 1.
5. Since 2n − 1 = xy for positive integers x, y both less than
2n − 1, we have 2n − 1 is not prime, by definition.
10
mathematical reasoning
√ p √ √ √
1= 1= (−1)(−1) = −1 −1 = ( −1)2 = −1
Clearly, something went wrong. What was it?

p √ √
(−1)(−1) ̸= −1 −1

11
mathematical reasoning
Usually, it is even harder to spot.

1=1
1/(−1) = 1/(−1)
1/(−1) = (−1)/1
p p
1/(−1) = (−1)/1
1/i = i/1
i2 = 1
−1 = 1

In a proof, every statement must logically follow from the previous


statements or from known truths.
What exactly are the rules for this? We will learn this over the
coming weeks.
12
logic
Logic: A way of thinking and reasoning exactly.
• In many settings, logic is helpful but not perfect. E.g., trying
to figure out where you left your phone.
• In math, logic is exact and always correct.
• When we use it (correctly), we can be certain that the
statements we derive are always true.
• We will learn how to use logical arguments to be certain that
a wide variety of mathematical statements are always true.
• These are called mathematical proofs.
• Almost all of your math courses here at UTSC will involve
understanding and creating proofs.
• So will many CS and Stats courses.
• Understanding the material in this course is crucial to being
able to succeed in those future courses.
some discussion points from class
Why are proofs useful?
• They allow us to be confident that a mathematical statement
is always true, so we can rely on it in a wide variety of settings
without worrying that it will ever fail.
• A proof can provide understanding of exactly why something
is always true.
• Attempting to prove a false statement is often the best way to
discover that it is false.
some discussion points from class
• You should be absolutely convinced by a proof.
• If a proof does not convince you that the statement must be
absolutely true, then you don’t understand it.
• When you are writing a proof, ask yourself whether you are
absolutely convinced of what you wrote.
• If you are not, then you don’t understand what you wrote and
so there is something wrong.

You might also like