Loading...
Loading...
Loading...
Get comfortable with logic, proofs, counting and graphs, the maths behind algorithms and computer science.
Free, no-obligation chat · Affordable plans that fit your budget · Start this week
About this course
Discrete mathematics is often the first course where students must write proofs instead of just computing answers. Induction, quantifiers and counting arguments feel unfamiliar, and it is hard to know whether a proof is complete. Problem sets move quickly, so gaps in logic show up early.
This course follows the standard university syllabus used with the textbooks by Rosen and by Lehman, Leighton and Meyer: propositional and predicate logic, proof techniques, sets and functions, relations, number theory, counting, probability, graph theory, trees, recurrences and Boolean algebra.
It is taught through affordable 1:1 mentoring. Your mentor explains each idea from your lectures, models how to structure a proof, and lets you try similar exercises while you talk through your reasoning. Message us on WhatsApp or email, or fill in the short form, for a free, no-obligation chat. We will suggest a plan that fits your budget and flexible timings in your time zone, and you can start this week.
Outcomes
Detailed syllabus
Every module lists its topics and what you will be able to do. Your mentor plans sessions around them and your own goals.
Precise statements and the rules for reasoning with them.
By the end of this module you can
Covered in 1:1 mentoring sessions
How to build a convincing mathematical proof.
By the end of this module you can
Covered in 1:1 mentoring sessions
Proving statements about all natural numbers and recursively defined objects.
By the end of this module you can
Covered in 1:1 mentoring sessions
The language used across all of computer science.
By the end of this module you can
Covered in 1:1 mentoring sessions
Ways of connecting elements of sets.
By the end of this module you can
Covered in 1:1 mentoring sessions
Integers, divisibility and modular arithmetic.
By the end of this module you can
Covered in 1:1 mentoring sessions
Counting without listing everything.
By the end of this module you can
Covered in 1:1 mentoring sessions
Probability in finite sample spaces.
By the end of this module you can
Covered in 1:1 mentoring sessions
Networks of vertices and edges, and the special case of trees.
By the end of this module you can
Covered in 1:1 mentoring sessions
Modelling repeated processes and the algebra of logic circuits.
By the end of this module you can
Covered in 1:1 mentoring sessions
Ways to learn
A mentor who knows this course plans sessions around your goal, explains each idea with fresh examples and checks your understanding. Personal attention, flexible timings in your time zone and affordable plans that fit your budget.
Talk to our teamHow it works
Four simple steps to start Discrete Mathematics with a mentor. A real person replies to you; there is no booking system.
Message us on WhatsApp or email, or fill in the short form. The first chat is free, with no obligation.
We listen to your goal, level and deadlines, then suggest a plan that fits your budget and timings.
Online 1:1 sessions with a mentor who knows your course, explains clearly and checks your understanding.
Keep going between sessions with practice, and watch your confidence grow week by week.
Learn by doing
Write a small program that evaluates a logical expression for every input and reports whether it is a tautology.
Prepare five worked induction proofs of different types, with a checklist of the base case, hypothesis and step for each.
Make a one-page guide that tells you which counting rule to use, with a worked example for each rule.
Model a small map or network as a graph and check degrees, connectivity, Euler paths and a spanning tree by hand and by code.
Your progress
Milestones from the start, middle and end of the syllabus.
Translate English statements into logic and negate them correctly
Early on
Compute gcds and modular inverses by hand
Halfway
Solve a simple recurrence in closed form
By the end
FAQs
Free, no-obligation chat
Tell us what you need. Our support team replies within one working day, by email or WhatsApp, whichever you prefer, and arranges your mentor.
Prefer to talk first?
Message the support team directly. We usually reply the same day.
Our mentors teach and explain. They never complete graded work, tests or assessments for students.
Keep going
Asymptotics, recurrences, divide and conquer, greedy, DP, graphs, network flow and NP-completeness.
Finite automata, regular and context-free languages, Turing machines, decidability and NP.
Complexity, arrays, lists, trees, graphs, sorting, greedy and dynamic programming.
Data representation, ISA, datapath, pipelining, caches, memory and I/O.
Lexing, parsing (LL, LR), semantic analysis, intermediate code, optimisation, code generation.
Last reviewed
Message us on WhatsApp or email, or fill in the short form. Our team replies with a plan that fits your goal and budget, and you can start this week.
Talk to us about a mentor