Logic: Name the objects and notation before applying a rule.
Proof methods
Proof methods: Connect the symbolic form to a graph, diagram, table, or example.
Sets and relations
Sets and relations: Compare two methods and record when each one is valid.
Counting
Counting: Finish with an unfamiliar problem and an independent check.
Recurrence relations
Recurrence relations: Name the objects and notation before applying a rule.
Graph theory
Graph theory: Connect the symbolic form to a graph, diagram, table, or example.
Number theory
Number theory: Compare two methods and record when each one is valid.
Eight original decision checks
These fixed prompts test study and verification choices across the course map. The interactive builder above creates mathematical questions separately.
Question 1: How many rows does a truth table need for a statement built from 5 different propositional variables?
Logic
32
25
10
64
Inspect the reasoning
Each variable can be true or false, so each one doubles the number of rows.
With n variables the table has 2^n rows.
2^5 = 2 x 2 x 2 x 2 x 2.
That equals 32 rows.
Best choice: 32
Question 2: What is the contrapositive of 'if n^2 is even, then n is even'?
Proof methods
If n is odd, then n^2 is odd.
If n is even, then n^2 is even.
If n^2 is odd, then n is odd.
If n is not even, then n^2 is even.
Inspect the reasoning
The contrapositive of 'if P then Q' is 'if not Q then not P'.
Here P is 'n^2 is even' and Q is 'n is even'.
Not Q is 'n is odd' and not P is 'n^2 is odd'.
So the contrapositive is 'if n is odd, then n^2 is odd', and it is logically equivalent to the original.
Best choice: If n is odd, then n^2 is odd.
Question 3: Set A has 12 elements, set B has 18, and their union has 25. How many elements are in the intersection?
Question 4: How many 4-letter strings can be made from the 26 letters if no letter repeats?
Counting
358,800
456,976
14,950
23,400
Inspect the reasoning
The first position has 26 choices.
Each later position loses one option: 25, then 24, then 23.
Multiply: 26 x 25 = 650, and 24 x 23 = 552.
650 x 552 = 358,800.
Best choice: 358,800
Question 5: A sequence has a(0) = 1 and a(n) = 2a(n - 1) + 3. What is a(4)?
Recurrence relations
61
29
45
31
Inspect the reasoning
Apply the rule one step at a time.
a(1) = 2(1) + 3 = 5 and a(2) = 2(5) + 3 = 13.
a(3) = 2(13) + 3 = 29.
a(4) = 2(29) + 3 = 61.
Best choice: 61
Question 6: How many edges does the complete graph on 7 vertices have?
Graph theory
21
42
49
14
Inspect the reasoning
In a complete graph every pair of vertices is joined exactly once.
So the count is 7 choose 2.
7 choose 2 = (7 x 6) / 2.
42 / 2 = 21 edges.
Best choice: 21
Question 7: What is 3^45 modulo 7?
Number theory
6
1
3
2
Inspect the reasoning
Fermat's little theorem gives 3^6 = 1 modulo 7, so powers repeat every 6 steps.
45 divided by 6 is 7 with a remainder of 3.
So 3^45 has the same remainder as 3^3.
3^3 = 27, and 27 = 3(7) + 6, so the answer is 6.
Best choice: 6
Question 8: A set has 9 elements. How many of its subsets contain one particular chosen element?
Sets and relations
256
512
9
128
Inspect the reasoning
Fix the chosen element as always included.
Each of the other 8 elements is free to be in or out.
That gives 2^8 possibilities.
2^8 = 256, which is exactly half of the 512 total subsets.
Best choice: 256
After the run
Sort each miss into interpretation, recall, setup, execution, verification, or pacing. Schedule a changed question that tests the corrected decision without reusing the same surface details.
When should I increase difficulty?
Increase it after setup is accurate without a clue and you can explain why the method fits.
When should I use test mode?
Use it once guided sets are stable and you want evidence about selection, pacing, and sustained attention.