
-
Introduction to Discrete Mathematics
-
1. Introduction
- Why the Study of Discrete Mathematics?
-
2. Module 1: Sets
- Basic Set Theory
- Basic Set Notations
- Sets Exploration
-
3. Module 2: Logic
- Logic Explained
- Notations and Examples
- Logic Rules of Inference
- Logical Equivalences
- Logic Exploration
-
4. Module 3: Counting
- Counting Methods
- Permutations vs Combinations Exploration
- Pascal's Triangle and Binomial Expansion
- Pascal's Triangle & Combinations Exploration
-
5. Module 4: Direct Proof
- Basic Definitions & Theorems
- Direct Proof Explained
- Example of a Direct Proof
- Direct Proof Exploration
-
6. Module 5a: Contrapositive Proof
- Contrapositive Proof Explained
- Example of a Contrapositive Proof
- Contrapositive Proof Exploration
-
7. Module 5b: Proof by Contradiction
- Proof by Contradiction Explained
- Example of a Proof by Contradiction
- Proof by Contradiction Exploration
-
8. Module 6a: Proving Non-Conditional Statements
- Non-Conditional Statements Explained
- Example of a If-and-Only-If Proof
- Example of Equivalent Statement
- Example of an Existence Proof
- Non-Conditional Statements Exploration
-
9. Module 6b: Proof Involving Sets
- Proof Involving Sets Explained
- Example of a Proof Involving Sets
- Proof Involving Sets Exploration
-
10. Module 7: Mathematical Induction
- Mathematical Induction Techniques
- Example of a Proof by Induction
- Example of a Proof by Strong Induction
- Example of a Proof by Smallest Counter-Example
- Fibonacci Numbers Exploration
- Mathematical Induction Exploration
-
11. Module 8: Relations
- Relations in Sets Explained
- Equivalence of Sets Exploration
- Integers Modulo n Exploration
-
12. Module 9: Functions
- Functions Explained
- Finding Inverse of a function
- Composition of Functions
- Injective , Surjective or Bijective
- Image & Pre-Image of a Functions
-
13. References
- References
This activity is also part of one or more other Books. Modifications will be visible in all these Books. Do you want to modify the original activity or create your own copy for this Book instead?
This activity was created by '{$1}'. Do you want to modify the original activity or create your own copy instead?
This activity was created by '{$1}' and you lack the permission to edit it. Do you want to create your own copy instead and add it to the book?
Introduction to Discrete Mathematics
Selma Bayton-FAU, Jun 24, 2023

Discrete mathematics
Table of Contents
- Introduction
- Why the Study of Discrete Mathematics?
- Module 1: Sets
- Basic Set Theory
- Basic Set Notations
- Sets Exploration
- Module 2: Logic
- Logic Explained
- Notations and Examples
- Logic Rules of Inference
- Logical Equivalences
- Logic Exploration
- Module 3: Counting
- Counting Methods
- Permutations vs Combinations Exploration
- Pascal's Triangle and Binomial Expansion
- Pascal's Triangle & Combinations Exploration
- Module 4: Direct Proof
- Basic Definitions & Theorems
- Direct Proof Explained
- Example of a Direct Proof
- Direct Proof Exploration
- Module 5a: Contrapositive Proof
- Contrapositive Proof Explained
- Example of a Contrapositive Proof
- Contrapositive Proof Exploration
- Module 5b: Proof by Contradiction
- Proof by Contradiction Explained
- Example of a Proof by Contradiction
- Proof by Contradiction Exploration
- Module 6a: Proving Non-Conditional Statements
- Non-Conditional Statements Explained
- Example of a If-and-Only-If Proof
- Example of Equivalent Statement
- Example of an Existence Proof
- Non-Conditional Statements Exploration
- Module 6b: Proof Involving Sets
- Proof Involving Sets Explained
- Example of a Proof Involving Sets
- Proof Involving Sets Exploration
- Module 7: Mathematical Induction
- Mathematical Induction Techniques
- Example of a Proof by Induction
- Example of a Proof by Strong Induction
- Example of a Proof by Smallest Counter-Example
- Fibonacci Numbers Exploration
- Mathematical Induction Exploration
- Module 8: Relations
- Relations in Sets Explained
- Equivalence of Sets Exploration
- Integers Modulo n Exploration
- Module 9: Functions
- Functions Explained
- Finding Inverse of a function
- Composition of Functions
- Injective , Surjective or Bijective
- Image & Pre-Image of a Functions
- References
- References
Why the Study of Discrete Mathematics?

Introduction to Discrete Mathematics is a foundational course that introduces fundamental concepts and techniques in the field of discrete mathematics. Discrete mathematics deals with mathematical structures and objects that are fundamentally discrete or countable in nature, as opposed to continuous mathematics that focuses on real numbers and continuous quantities.
The course typically begins with an overview of basic logic and proof techniques. Students learn about propositional and predicate logic, logical connectives, truth tables, and methods of proof such as direct proofs, proof by contradiction, and mathematical induction. This foundation in logic and proof is crucial for developing rigorous mathematical reasoning skills.
The course then delves into sets, functions, and relations. Students study set theory, including operations on sets, set cardinality, and the properties of subsets and power sets. They learn about functions, including injections, surjections, and bijections, and explore different types of relations such as equivalence relations and partial order relations.
Combinatorics is another major topic covered in the course. Students learn about counting techniques, including permutations, combinations, and the binomial theorem. They study principles of counting, such as the multiplication principle and the inclusion-exclusion principle, which are essential for solving problems related to arranging objects or selecting subsets.
Graph theory is an important component of discrete mathematics, and the course introduces students to the basics of graph theory. They learn about graph terminology, different types of graphs, graph representation, and basic graph algorithms. Topics covered may include paths, cycles, trees, connectivity, planarity, and graph coloring.
Additionally, the course may touch upon other topics such as propositional and predicate calculus, formal languages and automata theory, and discrete probability.
Finally, an introduction to discrete mathematics provides students with a solid foundation in mathematical reasoning, logic, and problem-solving skills. It is a fundamental course for students pursuing degrees in computer science, mathematics, or related fields, as it forms the basis for many advanced topics in these disciplines.
Saving…
All changes saved
Error
A timeout occurred. Trying to re-save …
Sorry, but the server is not responding. Please wait a few minutes and then try to save again.