What would you like to understand?

Popular destinationsCalculatorsCoursesPracticeFormulas

Unlock Premium Help

Explore every tutor and study workspace for seven days, with no daily AI cap during the trial.

Choose a billing period
Ask a parent to pay

Nothing is charged during the first seven days. Unless you cancel, the plan you selected begins when the trial ends and renews on its stated schedule. Manage cancellation from your plan page. Stripe handles the payment details.

← Discrete Mathematics
00:00

Find out what you can choose without a model.

Guided mode reveals one clue and immediate feedback. Quiet-test mode postpones the review until the complete run is submitted.

Course areas in this rehearsal

Treat the list as a dependency map. A later miss may point back to an earlier definition or representation.

Logic

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

  1. 32
  2. 25
  3. 10
  4. 64
Inspect the reasoning
  1. Each variable can be true or false, so each one doubles the number of rows.
  2. With n variables the table has 2^n rows.
  3. 2^5 = 2 x 2 x 2 x 2 x 2.
  4. 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

  1. If n is odd, then n^2 is odd.
  2. If n is even, then n^2 is even.
  3. If n^2 is odd, then n is odd.
  4. If n is not even, then n^2 is even.
Inspect the reasoning
  1. The contrapositive of 'if P then Q' is 'if not Q then not P'.
  2. Here P is 'n^2 is even' and Q is 'n is even'.
  3. Not Q is 'n is odd' and not P is 'n^2 is odd'.
  4. 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?

Sets and relations

  1. 5
  2. 7
  3. 30
  4. 13
Inspect the reasoning
  1. Inclusion-exclusion says |A union B| = |A| + |B| - |A intersect B|.
  2. 12 + 18 = 30.
  3. So 25 = 30 - |A intersect B|.
  4. |A intersect B| = 30 - 25 = 5.

Best choice: 5

Question 4: How many 4-letter strings can be made from the 26 letters if no letter repeats?

Counting

  1. 358,800
  2. 456,976
  3. 14,950
  4. 23,400
Inspect the reasoning
  1. The first position has 26 choices.
  2. Each later position loses one option: 25, then 24, then 23.
  3. Multiply: 26 x 25 = 650, and 24 x 23 = 552.
  4. 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

  1. 61
  2. 29
  3. 45
  4. 31
Inspect the reasoning
  1. Apply the rule one step at a time.
  2. a(1) = 2(1) + 3 = 5 and a(2) = 2(5) + 3 = 13.
  3. a(3) = 2(13) + 3 = 29.
  4. a(4) = 2(29) + 3 = 61.

Best choice: 61

Question 6: How many edges does the complete graph on 7 vertices have?

Graph theory

  1. 21
  2. 42
  3. 49
  4. 14
Inspect the reasoning
  1. In a complete graph every pair of vertices is joined exactly once.
  2. So the count is 7 choose 2.
  3. 7 choose 2 = (7 x 6) / 2.
  4. 42 / 2 = 21 edges.

Best choice: 21

Question 7: What is 3^45 modulo 7?

Number theory

  1. 6
  2. 1
  3. 3
  4. 2
Inspect the reasoning
  1. Fermat's little theorem gives 3^6 = 1 modulo 7, so powers repeat every 6 steps.
  2. 45 divided by 6 is 7 with a remainder of 3.
  3. So 3^45 has the same remainder as 3^3.
  4. 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

  1. 256
  2. 512
  3. 9
  4. 128
Inspect the reasoning
  1. Fix the chosen element as always included.
  2. Each of the other 8 elements is free to be in or out.
  3. That gives 2^8 possibilities.
  4. 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.

Printed question coverage
QuestionsReview
8 original promptsChoices, answer, and worked reasoning