Build strong logical thinking with An Introduction to Discrete Maths. Learn sets, relations, graphs, algorithms, and problem-solving techniques essential for computer science, programming, data analysis, and advanced mathematical understanding.
Save 93.18 % - OFFER ENDS SOON
Or
1 Year Access 
Intermediate
16 Students 
18 hours, 56 minutes 
Get access to 5000+ courses including this for only £49. Learn More.
Explore the fundamentals of Discrete Mathematics and develop essential mathematical skills through this comprehensive course. Learn key concepts including Mathematical Logic, Set Theory, Discrete Structures, Functions, and Relations while building a strong foundation in logical reasoning and analytical thinking. This course introduces learners to the core principles required for advanced mathematics, computer science, and problem-solving applications.
This course covers important areas such as Graph Theory, Combinatorics, Number Theory, Boolean Algebra, and Algorithms Basics to help learners understand how mathematical concepts are applied in real-world scenarios. Through topics like proofs, sequences and series, and statistics, participants will strengthen their ability to analyse patterns, solve problems, and approach complex challenges systematically.
Designed for students, professionals, and anyone interested in mathematics, this Discrete Mathematics course provides practical knowledge of essential mathematical techniques and structures. By exploring logic, relationships, graphs, and combinatorial methods, learners will enhance their Problem Solving abilities and gain valuable skills that support careers in technology, data science, engineering, and academic research.
Extra Gift Included: +
Learners complete an assignment designed to evaluate their understanding of the course content. The assignment is reviewed by qualified tutors who provide personalised feedback, allowing learners to demonstrate their applied knowledge and skills.
After completing the An Introduction to Discrete Maths course assessment, you will be eligible to receive a CPD-accredited certificate worth £9 from One Education to demonstrate your achievement.
The certificate is also available as a printed hard copy delivered by post for £15.
An Introduction to Discrete Maths introduces learners to the fundamental concepts of discrete mathematical structures and their real-world applications. This course explores mathematical logic, set theory, functions, relations, graph theory, combinatorics, and basic algorithms to develop essential problem-solving skills.
Studying An Introduction to Discrete Maths strengthens logical reasoning, analytical thinking, and computational understanding. The course provides a strong foundation for further study and supports career pathways in computer science, mathematics, data analysis, software development, and technology-related fields.
The An Introduction to Discrete Maths course has a total study time of 18 hours, 56 minutes. This comprehensive programme is designed for flexible learning, allowing learners to progress at their own pace while exploring discrete mathematics concepts, including mathematical logic, set theory, graph theory, combinatorics, number theory, algorithms basics, Boolean algebra, discrete structures, proof techniques, and problem-solving methods.
The An Introduction to Discrete Maths course requirements are simple and suitable for beginners. Learners should have a basic understanding of mathematics, an interest in logical thinking, problem-solving, and mathematical structures, and a willingness to explore topics such as sets, logic, graphs, and algorithms. Access to an internet-enabled device and commitment to regular study are recommended for effective learning and successful course completion.
This course introduces the fundamentals of discrete mathematics, covering mathematical logic, set theory, graph theory, combinatorics, number theory, algorithms basics, Boolean algebra, discrete structures, functions, relations, proofs, and problem-solving techniques.
No. It is suitable for beginners, students, and anyone interested in developing mathematical reasoning, logical thinking, and problem-solving skills. A basic understanding of mathematics is recommended.
The course is delivered online, allowing you to learn at your own pace and develop essential discrete mathematics skills conveniently.
Yes. Mathematical exercises, logic problems, proof-based activities, problem-solving tasks, and quizzes may be included to reinforce learning.
You will receive a certificate of completion after successfully finishing the course.
This course supports academic and professional development in computer science, software development, data science, cybersecurity, mathematics, engineering, research, and other fields requiring analytical and logical thinking skills.
| Sets | |||
| Introduction to Sets | 00:01:00 | ||
| Definition of Set | 00:09:00 | ||
| Number Sets | 00:10:00 | ||
| Set Equality | 00:09:00 | ||
| Set-Builder Notation | 00:10:00 | ||
| Types of Sets | 00:12:00 | ||
| Subsets | 00:10:00 | ||
| Power Set | 00:05:00 | ||
| Ordered Pairs | 00:05:00 | ||
| Cartesian Products | 00:14:00 | ||
| Cartesian Plane | 00:04:00 | ||
| Venn Diagrams | 00:03:00 | ||
| Set Operations (Union, Intersection) | 00:15:00 | ||
| Properties of Union and Intersection | 00:10:00 | ||
| Set Operations (Difference, Complement) | 00:12:00 | ||
| Properties of Difference and Complement | 00:07:00 | ||
| De Morgan’s Law | 00:08:00 | ||
| Partition of Sets | 00:16:00 | ||
| Logic | |||
| Introduction | 00:01:00 | ||
| Statements | 00:07:00 | ||
| Compound Statements | 00:13:00 | ||
| Truth Tables | 00:09:00 | ||
| Examples | 00:13:00 | ||
| Logical Equivalences | 00:07:00 | ||
| Tautologies and Contradictions | 00:06:00 | ||
| De Morgan’s Laws in Logic | 00:12:00 | ||
| Logical Equivalence Laws | 00:03:00 | ||
| Conditional Statements | 00:13:00 | ||
| Negation of Conditional Statements | 00:10:00 | ||
| Converse and Inverse | 00:07:00 | ||
| Biconditional Statements | 00:09:00 | ||
| Examples | 00:12:00 | ||
| Digital Logic Circuits | 00:13:00 | ||
| Black Boxes and Gates | 00:15:00 | ||
| Boolean Expressions | 00:06:00 | ||
| Truth Tables and Circuits | 00:09:00 | ||
| Equivalent Circuits | 00:07:00 | ||
| NAND and NOR Gates | 00:07:00 | ||
| Quantified Statements – ALL | 00:08:00 | ||
| Quantified Statements – THERE EXISTS | 00:07:00 | ||
| Negations of Quantified Statements | 00:08:00 | ||
| Number Theory | |||
| Introduction | 00:01:00 | ||
| Parity | 00:13:00 | ||
| Divisibility | 00:11:00 | ||
| Prime Numbers | 00:08:00 | ||
| Prime Factorisation | 00:09:00 | ||
| GCD & LCM | 00:17:00 | ||
| Proof | |||
| Intro | 00:06:00 | ||
| Terminologies | 00:08:00 | ||
| Direct Proofs | 00:09:00 | ||
| Proofs by Contrapositive | 00:11:00 | ||
| Proofs by Contradiction | 00:17:00 | ||
| Exhaustion Proofs | 00:14:00 | ||
| Existence & Uniqueness Proofs | 00:16:00 | ||
| Proofs by Induction | 00:12:00 | ||
| Examples | 00:19:00 | ||
| Functions | |||
| Intro | 00:01:00 | ||
| Functions | 00:15:00 | ||
| Evaluating a Function | 00:13:00 | ||
| Domains | 00:16:00 | ||
| Range | 00:05:00 | ||
| Graphs | 00:16:00 | ||
| Graphing Calculator | 00:06:00 | ||
| Extracting Info from a Graph | 00:12:00 | ||
| Domain & Range from a Graph | 00:08:00 | ||
| Function Composition | 00:10:00 | ||
| Function Combination | 00:09:00 | ||
| Even and Odd Functions | 00:08:00 | ||
| One to One (Injective) Functions | 00:09:00 | ||
| Onto (Surjective) Functions | 00:07:00 | ||
| Inverse Functions | 00:10:00 | ||
| Long Division | 00:16:00 | ||
| Relations | |||
| Intro | 00:01:00 | ||
| The Language of Relations | 00:10:00 | ||
| Relations on Sets | 00:13:00 | ||
| The Inverse of a Relation | 00:06:00 | ||
| Reflexivity, Symmetry and Transitivity | 00:13:00 | ||
| Examples | 00:08:00 | ||
| Properties of Equality & Less Than | 00:08:00 | ||
| Equivalence Relation | 00:07:00 | ||
| Equivalence Class | 00:07:00 | ||
| Graph Theory | |||
| Intro | 00:01:00 | ||
| Graphs | 00:11:00 | ||
| Subgraphs | 00:09:00 | ||
| Degree | 00:10:00 | ||
| Sum of Degrees of Vertices Theorem | 00:23:00 | ||
| Adjacency and Incidence | 00:09:00 | ||
| Adjacency Matrix | 00:16:00 | ||
| Incidence Matrix | 00:08:00 | ||
| Isomorphism | 00:08:00 | ||
| Walks, Trails, Paths, and Circuits | 00:13:00 | ||
| Examples | 00:10:00 | ||
| Eccentricity, Diameter, and Radius | 00:07:00 | ||
| Connectedness | 00:20:00 | ||
| Euler Trails and Circuits | 00:18:00 | ||
| Fleury’s Algorithm | 00:10:00 | ||
| Hamiltonian Paths and Circuits | 00:06:00 | ||
| Ore’s Theorem | 00:14:00 | ||
| The Shortest Path Problem | 00:13:00 | ||
| Statistics | |||
| Intro | 00:01:00 | ||
| Terminologies | 00:03:00 | ||
| Mean | 00:04:00 | ||
| Median | 00:03:00 | ||
| Mode | 00:03:00 | ||
| Range | 00:08:00 | ||
| Outlier | 00:04:00 | ||
| Variance | 00:09:00 | ||
| Standard Deviation | 00:04:00 | ||
| Combinatorics | |||
| Intro | 00:03:00 | ||
| Factorials | 00:08:00 | ||
| The Fundamental Counting Principle | 00:13:00 | ||
| Permutations | 00:13:00 | ||
| Combinations | 00:12:00 | ||
| Pigeonhole Principle | 00:06:00 | ||
| Pascal’s Triangle | 00:08:00 | ||
| Sequence and Series | |||
| Intro | 00:01:00 | ||
| Sequence | 00:07:00 | ||
| Arithmetic Sequences | 00:12:00 | ||
| Geometric Sequences | 00:09:00 | ||
| Partial Sums of Arithmetic Sequences | 00:12:00 | ||
| Partial Sums of Geometric Sequences | 00:07:00 | ||
| Series | 00:13:00 | ||
| Assignment | |||
| Assignment – An Introduction to Discrete Maths | 00:00:00 | ||
Take All courses for £49