Scribd
Upload
16 views8 pages

Introduction To Discrete Mathematics

Intro to Discrete Math

Uploaded by

Ariezeus King
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
16 views8 pages

Introduction To Discrete Mathematics

Intro to Discrete Math

Uploaded by

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

Introduction to Discrete

Mathematics
Lesson 1 – Part 1
Basics of Discrete Math
• The study of mathematics that falls outside the realm
of calculus.
• Calculus is the study of continuous math concepts,
whereas this topic is discrete – separable, countable,
or quantified objects.
• In Electronics, it can be thought of as the difference
between analog and digital.
Examples of Discrete vs
Continuous
Discrete math for programming
Computers
• Computers operate in a discrete manner.
• Machine language is a series of binary bits and bytes.
• A bit has a value of either one or zero or a Boolean value of true or false.
• Logical expression evaluates to true or false.
• E.g., If the total charges are greater than $75 and the customer lives in the US, then shipping is
free.
• Program Efficiency – Evaluating algorithms to determine run time.
• E.g., choosing the best sorting algorithm based on input size.
Real-world discrete math
• Logic – the study of formal reasoning
• Discrete Math involves many forms of evaluating logical
statements.

For example, how would you prove


your client is innocent?
Abstract Discrete Math
• Abstract math provides the conceptual background and theory that
justify the use of Math in applications.
• Requires conceptual reasoning about abstract ideas, including
manipulating symbols.
• Particularly understanding and constructing proofs.
• Prove theorems using mathematical ideas.
• Relatively fewer formulas. Instead, master fundamental concepts and
apply them.
Proofs
• Abstraction allows for solving complex problems.
• E.g., one supposes that a particular but arbitrarily
chosen element x in D for which P(x) – the proposition
– is true.
• Based on this, show that Q(x) must also be true.
• Now, we can generalize a more specific solution.
References
• Kwong, H. (2015, November 6). A Spiral Workbook for
Discrete Mathematics. Milne Open Textbooks.
https://milneopentextbooks.org/a-spiral-workbook-for-discre
te-mathematics/

You might also like