# Discrete Mathematics: The Complete 7 Chapter Course [Free Online Course] - TechCracked

Discrete Mathematics: Number Theory, Graph theory, Set theory, Logic, Proofs, Combinatorics & Functions and Relations

This course includes
• 4 hours on-demand video
• 23 articles
• Access on mobile and TV

What you'll learn
• Most comprehensive course on the market in Discrete Math
• Fully understand the fundamentals of mathematical logic
• Solve problems with propositions and quantifiers with mathematical logic
• Build truth tables and understand basics of digital logic design
• Learn to apply indirect, direct and other methods of proofs
• Learn to check for divisibility as well as learn the method of Euclidean algorithm
• Fully understand how equivalence, partial order and binary relations work
• Learn about bijective and injective functions
• Master the fundamentals of counting
• Grasp the consepts of combinations and permutations and be able to use them to solve problems

Description

In this course you will learn discrete mathematics and study mathematical logic, mathematical proofs, set theory, functions, relations, graph theory, number theory as well as combinations and permutations.

Each chapter of the course can be taken independently if required, and each chapter covers all of the listed topics in details so you will study everything that is necessary and in the order that most suits you as a student. As students usually come to this course for specific topic(s) and exercises, here is the comprehensive list of what you will learn from each chapter of this course:

• Logic: Propositions, Connectives, Truth Tables, Logic Gates, Conditional and Biconditional Propositions, Rules of Inference, Predicates and Quantifiers
• Proofs: Direct and Indirect Proofs, Proof by Induction and other Methods of Proof
• Sets: Sets and Number Sets, Complement Sets, Cartesian Product, Operations, Boolean Algebra and De Morgan's Law
• Functions and relations: Ordered Pair, Dom, Range, Inverse Relations
• Graphs: Simple and Complete Graph, Bipartite Graph, Paths and Circuits, Euler Circuit and Euler Path, Hamiltonian Circuit and Hamiltonian Path, Trees
• Numbers: Divisibility and Division Algorithm, Euclidean Algorithm
• Combinatorics: Combinations, Permutations, Fundamental Principle of Counting

Enroll Now