B10 · Discrete mathematics exercise selection
Exercise readings are in English. Indonesian section titles come from the translation backend. Selection follows book order; it does not assess mastery or infer prerequisites.
Hints, answers and solutions retain their source-unit relationships. A missing supplied solution does not mean an exercise is unsolvable. Example solutions are not counted as exercise solutions.
Select sections
Exercises
Changing filters clears selections that no longer match. Select exercises, then download a plan.
Study plan
Educator or learner notes, not objectives asserted to come from the book.
This plan works offline, but contains neither the textbook nor interactive selectors. Reading links need a network connection or a separately downloaded reader.
Read section (English)
- 0.1 · What is Discrete Mathematics?
- 0.2 · Discrete Structures
- 1.1 · Mathematical Statements
- 1.2 · Implications
- 1.3 · Rules of Logic
- 1.4 · Proofs
- 1.5 · Proofs about Discrete Structures
- 1.6 · Chapter Summary
- 2.1 · Problems and Definitions
- 2.2 · Trees
- 2.3 · Planar Graphs
- 2.4 · Euler Trails and Circuits
- 2.5 · Coloring
- 2.6 · Relations and Graphs
- 2.7 · Matching in Bipartite Graphs
- 2.8 · Chapter Summary
- 3.1 · Pascal’s Arithmetical Triangle
- 3.2 · Combining Outcomes
- 3.3 · Non-Disjoint Outcomes
- 3.4 · Combinations and Permutations
- 3.5 · Counting Multisets
- 3.6 · Combinatorial Proofs
- 3.7 · Applications to Probability
- 3.8 · Advanced Counting Using PIE
- 3.9 · Chapter Summary
- 4.1 · Describing Sequences
- 4.2 · Rate of Growth
- 4.3 · Polynomial Sequences
- 4.4 · Exponential Sequences
- 4.5 · Proof by Induction
- 4.6 · Strong Induction
- 4.7 · Chapter Summary
- 5.1 · Sets
- 5.2 · Functions
- 6.1 · Generating Functions
- 6.2 · Introduction to Number Theory
Sources and scope
Oscar Levin · Discrete Mathematics: An Open Introduction, 4th Edition · CC BY-NC-SA 4.0
Selectors and metadata work offline. Textbook bodies, automatic scoring and external services are not included.