Discrete Math Pacing Guide and Standards Coverage
A 180-day full-year plan in two semesters, a compressed one-semester (90-day block) plan, and a table showing which question-bank skills practice each Discrete Mathematics strand or Common Core standard. Every lesson has a ready plan in the Lesson Planner.
Full year · One-semester block · Standards coverage
Full year (180 days, 36 weeks)
| Unit | Days | Weeks | Lessons |
|---|---|---|---|
| Unit 1: Speaking Mathematically | 1–16 (16) | 1–4 | Variables and Mathematical Statements; Universal and Existential Statements; Conditional Statements; Set-Roster and Set-Builder Notation; Subsets and Set Membership; Cartesian Products and Ordered Pairs; Strings and Mathematical Notation |
| Unit 2: The Logic of Compound Statements | 17–33 (17) | 4–7 | Negation, Conjunction, and Disjunction; Truth Tables and Truth Values; Logical Equivalence; Conditional Statements and Equivalent Forms; Negating Conditional Statements; Converse, Inverse, and Contrapositive; Rules of Inference and Valid Arguments; Fallacies and Contradictions |
| Unit 3: Elementary Number Theory and Methods of Proof | 34–50 (17) | 7–10 | Definitions, Conjectures, and Counterexamples; Direct Proof; Proving Existential and Universal Statements; Properties of Integers and Rational Numbers; Divisibility and Number-Theory Arguments; Proof by Contradiction; Proof by Contraposition; Choosing a Proof Strategy |
| Unit 4: Sequences, Mathematical Induction, and Recursion | 51–69 (19) | 11–14 | Sequences and Explicit Formulas; Arithmetic and Geometric Patterns; Factorials and Binomial Coefficient Notation; Fibonacci Sequences; Recursively Defined Sequences; Iteration and Recursive Computation; The Principle of Mathematical Induction; Writing Inductive Proofs; Patterns and Tessellations |
| Unit 5: Set Theory | 70–86 (17) | 14–18 | Set Equality and the Empty Set; Union, Intersection, and Difference; Complements and Set Operations; Venn Diagrams; Power Sets; Proving Subset Relations; Proving Set Equality and Set Identities; Disproving Set Statements |
| Semester 1 review and exam (days 87–89) | |||
| Unit 6: Properties of Relations | 90–105 (16) | 18–21 | Relations and Their Inverses; Directed Graphs of Relations; Reflexive, Symmetric, and Transitive Properties; Relations on Finite and Infinite Sets; Partitions and Induced Relations; Equivalence Relations; Equivalence Classes |
| Unit 7: Counting and Probability | 106–122 (17) | 22–25 | Sample Spaces and Events; Lists, Sublists, and One-Dimensional Arrays; Possibility Trees; The Addition Counting Rule; The Multiplication Counting Rule; Counting Outcomes Systematically; Probability with Equally Likely Outcomes; Applying Counting Rules to Probability |
| Unit 8: Theory of Graphs and Trees | 123–138 (16) | 25–28 | Vertices, Edges, Endpoints, and Loops; Directed and Undirected Graphs; Constructing Graphs from Given Characteristics; Graph Coloring; Trails and Paths; Circuits; Constructing and Characterizing Trees |
| Unit 9: Election Theory | 139–155 (17) | 28–31 | Voting Terminology and Preference Data; Comparing Voting Methods; Analyzing Election Results; Weighted Voting Systems and Quotas; Coalitions and Voting Power; Fair-Division Methods; Apportionment Methods; Comparing Fairness and Outcomes |
| Unit 10: Linear Programming | 156–171 (16) | 32–35 | Writing Constraints from Real-World Situations; Graphing Systems of Linear Inequalities; Feasible Regions; Objective Functions; Vertices and Candidate Solutions; Maximizing and Minimizing in Two Variables; Interpreting Optimal Solutions in Context |
| Final review and exam (days 172–180) | |||
One semester (90-day block)
On a block schedule each 90-minute class covers two days of the full-year plan: a lesson and its practice, or two lessons. Day 1 is the launch and diagnostic.
| Unit | Block days |
|---|---|
| Unit 1: Speaking Mathematically | 2–9 (8) |
| Unit 2: The Logic of Compound Statements | 10–18 (9) |
| Unit 3: Elementary Number Theory and Methods of Proof | 19–27 (9) |
| Unit 4: Sequences, Mathematical Induction, and Recursion | 28–37 (10) |
| Unit 5: Set Theory | 38–46 (9) |
| Unit 6: Properties of Relations | 47–54 (8) |
| Unit 7: Counting and Probability | 55–63 (9) |
| Unit 8: Theory of Graphs and Trees | 64–71 (8) |
| Unit 9: Election Theory | 72–80 (9) |
| Unit 10: Linear Programming | 81–88 (8) |
| Final review and exam | 89–90 |
Standards coverage
Each question-bank skill is tagged with the standards it practices.
| Standard | What it asks | Skills that practice it |
|---|---|---|
| DM.COUNTING.1 | Describe sample spaces and list events as subsets of the sample space. | 1 skill: Sample Spaces and Events |
| DM.COUNTING.2 | Count the elements of lists and sublists, including multiples in a range. | 1 skill: Lists, Sublists, and One-Dimensional Arrays |
| DM.COUNTING.3 | Draw possibility trees and count outcomes from them. | 1 skill: Possibility Trees |
| DM.COUNTING.4 | Count with the addition rule and inclusion–exclusion. | 1 skill: The Addition Counting Rule |
| DM.COUNTING.5 | Count with the multiplication rule. | 1 skill: The Multiplication Counting Rule |
| DM.COUNTING.6 | Choose between permutations and combinations and count systematically. | 1 skill: Counting Outcomes Systematically |
| DM.COUNTING.7 | Find probabilities with equally likely outcomes. | 1 skill: Probability with Equally Likely Outcomes |
| DM.COUNTING.8 | Apply counting rules to compute probabilities. | 1 skill: Applying Counting Rules to Probability |
| DM.ELECTIONS.1 | Read preference schedules and count voters, first-place votes and majorities. | 1 skill: Voting Terminology and Preference Data |
| DM.ELECTIONS.2 | Find winners by plurality, Borda count, instant runoff and pairwise comparisons. | 1 skill: Comparing Voting Methods |
| DM.ELECTIONS.3 | Check election results against fairness criteria. | 1 skill: Analyzing Election Results |
| DM.ELECTIONS.4 | Analyze weighted voting systems: quotas, dictators, veto power and dummies. | 1 skill: Weighted Voting Systems and Quotas |
| DM.ELECTIONS.5 | Measure voting power with the Banzhaf and Shapley–Shubik indices. | 1 skill: Coalitions and Voting Power |
| DM.ELECTIONS.6 | Divide goods fairly with divider–chooser, sealed bids and markers. | 1 skill: Fair-Division Methods |
| DM.ELECTIONS.7 | Apportion seats with Hamilton's, Jefferson's, Webster's and Adams's methods. | 1 skill: Apportionment Methods |
| DM.ELECTIONS.8 | Compare methods for fairness and recognize apportionment paradoxes. | 1 skill: Comparing Fairness and Outcomes |
| DM.GRAPHS.1 | Identify vertices, edges, loops and parallel edges and use the handshake theorem. | 1 skill: Vertices, Edges, Endpoints, and Loops |
| DM.GRAPHS.2 | Find in-degrees and out-degrees in directed graphs and choose directed or undirected models. | 1 skill: Directed and Undirected Graphs |
| DM.GRAPHS.3 | Construct graphs with given properties and recognize complete and bipartite graphs. | 1 skill: Constructing Graphs from Given Characteristics |
| DM.GRAPHS.4 | Color graphs and find chromatic numbers in scheduling problems. | 1 skill: Graph Coloring |
| DM.GRAPHS.5 | Classify walks, trails and paths and find Euler trails. | 1 skill: Trails and Paths |
| DM.GRAPHS.6 | Find Euler circuits and Hamiltonian cycles. | 1 skill: Circuits |
| DM.GRAPHS.7 | Characterize trees and find minimum spanning trees. | 1 skill: Constructing and Characterizing Trees |
| DM.INDUCTION.1 | Find terms of sequences from explicit formulas and evaluate Σ and Π notation. | 1 skill: Sequences and Explicit Formulas |
| DM.INDUCTION.2 | Recognize arithmetic and geometric sequences and find terms and sums. | 1 skill: Arithmetic and Geometric Patterns |
| DM.INDUCTION.3 | Evaluate and simplify factorials and binomial coefficients. | 1 skill: Factorials and Binomial Coefficient Notation |
| DM.INDUCTION.4 | Generate Fibonacci numbers and use Fibonacci identities. | 1 skill: Fibonacci Sequences |
| DM.INDUCTION.5 | Compute terms of recursively defined sequences and write recursive definitions. | 1 skill: Recursively Defined Sequences |
| DM.INDUCTION.6 | Use iteration to find explicit formulas for recurrences and solve recursive problems. | 1 skill: Iteration and Recursive Computation |
| DM.INDUCTION.7 | State the parts of a proof by mathematical induction. | 1 skill: The Principle of Mathematical Induction |
| DM.INDUCTION.8 | Write complete inductive proofs for sums, divisibility and inequalities. | 1 skill: Writing Inductive Proofs |
| DM.INDUCTION.9 | Describe and count growing patterns, polygon angles and tessellations. | 1 skill: Patterns and Tessellations |
| DM.LANG.1 | Use variables to write mathematical statements and decide whether a sentence is a statement. | 1 skill: Variables and Mathematical Statements |
| DM.LANG.2 | Write and decide the truth of universal and existential statements. | 1 skill: Universal and Existential Statements |
| DM.LANG.3 | Write conditional statements in if–then form and identify the hypothesis and conclusion. | 1 skill: Conditional Statements |
| DM.LANG.4 | Write sets in roster and set-builder notation and move between the two. | 1 skill: Set-Roster and Set-Builder Notation |
| DM.LANG.5 | Decide set membership and subset relations, including with the empty set. | 1 skill: Subsets and Set Membership |
| DM.LANG.6 | List and count Cartesian products and use ordered pairs. | 1 skill: Cartesian Products and Ordered Pairs |
| DM.LANG.7 | Find the lengths and concatenations of strings over an alphabet and count strings. | 1 skill: Strings and Mathematical Notation |
| DM.LOGIC.1 | Translate between English and symbols using ¬, ∧ and ∨ and find truth values. | 1 skill: Negation, Conjunction, and Disjunction |
| DM.LOGIC.2 | Build truth tables for compound statements. | 1 skill: Truth Tables and Truth Values |
| DM.LOGIC.3 | Decide logical equivalence with truth tables and laws such as De Morgan's. | 1 skill: Logical Equivalence |
| DM.LOGIC.4 | Find truth values of conditionals and biconditionals and rewrite p → q as ¬p ∨ q. | 1 skill: Conditional Statements and Equivalent Forms |
| DM.LOGIC.5 | Negate conditional statements correctly in symbols and in words. | 1 skill: Negating Conditional Statements |
| DM.LOGIC.6 | Write the converse, inverse and contrapositive and decide which are equivalent. | 1 skill: Converse, Inverse, and Contrapositive |
| DM.LOGIC.7 | Test arguments for validity and use rules of inference such as modus ponens and modus tollens. | 1 skill: Rules of Inference and Valid Arguments |
| DM.LOGIC.8 | Recognize the converse and inverse errors and contradictions. | 1 skill: Fallacies and Contradictions |
| DM.LP.1 | Write constraints and an objective from a real-world situation. | 1 skill: Writing Constraints from Real-World Situations |
| DM.LP.2 | Graph systems of linear inequalities and test points. | 1 skill: Graphing Systems of Linear Inequalities |
| DM.LP.3 | Find and describe feasible regions and their corner points. | 1 skill: Feasible Regions |
| DM.LP.4 | Write and evaluate objective functions and read level lines. | 1 skill: Objective Functions |
| DM.LP.5 | Find corner points by solving boundary equations and list candidate solutions. | 1 skill: Vertices and Candidate Solutions |
| DM.LP.6 | Maximize or minimize an objective with the corner-point method and recognize special cases. | 1 skill: Maximizing and Minimizing in Two Variables |
| DM.LP.7 | Interpret optimal solutions, binding constraints and slack in context. | 1 skill: Interpreting Optimal Solutions in Context |
| DM.PROOF.1 | Use the definitions of even, odd, prime and composite and test conjectures with counterexamples. | 1 skill: Definitions, Conjectures, and Counterexamples |
| DM.PROOF.2 | Write direct proofs of statements about integers. | 1 skill: Direct Proof |
| DM.PROOF.3 | Prove existential statements with a witness and universal statements in general, and disprove with counterexamples. | 1 skill: Proving Existential and Universal Statements |
| DM.PROOF.4 | Prove facts about rational numbers and use the quotient–remainder theorem. | 1 skill: Properties of Integers and Rational Numbers |
| DM.PROOF.5 | Prove divisibility facts and use gcd, lcm and prime factorization. | 1 skill: Divisibility and Number-Theory Arguments |
| DM.PROOF.6 | Write proofs by contradiction. | 1 skill: Proof by Contradiction |
| DM.PROOF.7 | Prove statements by proving their contrapositive. | 1 skill: Proof by Contraposition |
| DM.PROOF.8 | Choose a suitable proof strategy for a statement. | 1 skill: Choosing a Proof Strategy |
| DM.RELATIONS.1 | List relations as sets of ordered pairs and find inverse relations. | 1 skill: Relations and Their Inverses |
| DM.RELATIONS.2 | Draw and read directed graphs of relations. | 1 skill: Directed Graphs of Relations |
| DM.RELATIONS.3 | Decide whether a relation is reflexive, symmetric or transitive. | 1 skill: Reflexive, Symmetric, and Transitive Properties |
| DM.RELATIONS.4 | Decide properties of relations on infinite sets with general arguments and counterexamples. | 1 skill: Relations on Finite and Infinite Sets |
| DM.RELATIONS.5 | Recognize partitions and find the relation a partition induces. | 1 skill: Partitions and Induced Relations |
| DM.RELATIONS.6 | Decide whether a relation is an equivalence relation. | 1 skill: Equivalence Relations |
| DM.RELATIONS.7 | Find equivalence classes and the partition they form. | 1 skill: Equivalence Classes |
| DM.SETS.1 | Decide set equality and work with the empty set. | 1 skill: Set Equality and the Empty Set |
| DM.SETS.2 | Find unions, intersections and differences of sets. | 1 skill: Union, Intersection, and Difference |
| DM.SETS.3 | Find complements and evaluate expressions with several set operations. | 1 skill: Complements and Set Operations |
| DM.SETS.4 | Draw and read Venn diagrams with two and three sets. | 1 skill: Venn Diagrams |
| DM.SETS.5 | List and count the elements of power sets. | 1 skill: Power Sets |
| DM.SETS.6 | Prove that one set is a subset of another by the element method. | 1 skill: Proving Subset Relations |
| DM.SETS.7 | Prove set equalities and identities with element arguments and set laws. | 1 skill: Proving Set Equality and Set Identities |
| DM.SETS.8 | Disprove false set statements with counterexamples. | 1 skill: Disproving Set Statements |
| A-CED.A.2 | Create equations in two or more variables; graph them on coordinate axes with labels and scales. | 1 skill: Objective Functions |
| A-CED.A.3 | Represent constraints by equations or inequalities and interpret solutions as viable or not. | 3 skills: Writing Constraints from Real-World Situations; Maximizing and Minimizing in Two Variables; Interpreting Optimal Solutions in Context |
| A-REI.C.6 | Solve systems of linear equations exactly and approximately, focusing on pairs of equations. | 1 skill: Vertices and Candidate Solutions |
| A-REI.D.12 | Graph the solutions to a linear inequality as a half-plane, and to a system as the intersection. | 2 skills: Graphing Systems of Linear Inequalities; Feasible Regions |
| A-SSE.B.4 | Derive and use the formula for the sum of a finite geometric series. | 1 skill: Arithmetic and Geometric Patterns |
| F-BF.A.2 | Write arithmetic and geometric sequences recursively and explicitly; translate between forms. | 3 skills: Arithmetic and Geometric Patterns; Recursively Defined Sequences; Iteration and Recursive Computation |
| F-IF.A.3 | Recognize that sequences are functions whose domain is a subset of the integers. | 3 skills: Sequences and Explicit Formulas; Fibonacci Sequences; Recursively Defined Sequences |
| F-LE.A.2 | Construct linear and exponential functions, including arithmetic and geometric sequences, from a graph, description or table. | 1 skill: Arithmetic and Geometric Patterns |
| N-RN.B.3 | Explain why sums and products of rational and irrational numbers are rational or irrational. | 1 skill: Properties of Integers and Rational Numbers |
| S-CP.A.1 | Describe events as subsets of a sample space using unions, intersections and complements. | 5 skills: Sample Spaces and Events; Probability with Equally Likely Outcomes; Union, Intersection, and Difference; Complements and Set Operations; Venn Diagrams |
| S-CP.B.9 | Use permutations and combinations to compute probabilities of compound events. | 3 skills: Counting Outcomes Systematically; Applying Counting Rules to Probability; Factorials and Binomial Coefficient Notation |
| S-MD.A.1 | Define a random variable for a quantity of interest and graph its probability distribution. | 2 skills: Probability with Equally Likely Outcomes; Applying Counting Rules to Probability |
89 of 89 standards have question-bank practice.