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.

Question 1

Discrete Math practice

Train discrete math through short sets that reveal the first step that needs attention.

0 correct 0 attempted
Choose the pressureBuild the method, apply it, then stretch it.
Discrete MathBuild

Preparing your first question…

Claims and counterexamples in this session

The labels below define the retrieval territory; the questions vary their surface form.

Logic and proof methods

State the claim, name the permitted facts, build the implication, and search for a counterexample.

Sets, relations, and functions

State the claim, name the permitted facts, build the implication, and search for a counterexample.

Counting and recurrences

State the claim, name the permitted facts, build the implication, and search for a counterexample.

Graphs and number theory

State the claim, name the permitted facts, build the implication, and search for a counterexample.

Review the earliest unsupported implication

For each miss, identify the earliest decision that stopped being justified. Repair that exact connection, then solve a changed question before considering the skill secure.

When to raise the pressure

Move from Build to Apply when the setup no longer needs a hint. Use Stretch after you can explain why the method fits and detect an unreasonable answer on your own.

100-question original library

Each test contains 10 questions drawn without replacement from this subject's 100-question library. This browser remembers which questions the student has already seen, while signed-in students can save completed test results to their free profile.

What this discrete math set covers

Logic and proof methods

Build converses and contrapositives, and choose between direct proof, contraposition, contradiction, and induction.

Sets, relations, and functions

Use inclusion-exclusion on set sizes, and count or classify functions as injective, surjective, or bijective.

Counting and recurrences

Choose between permutations and combinations, and unroll a recurrence relation term by term to find a later value.

Graphs and number theory

Apply the handshake lemma and connectivity rules, and use the Euclidean algorithm for gcd, lcm, and modular arithmetic.

Choose the right pressure

LevelWhat changesSuggested pace
BuildOne idea is visible and the numbers leave room to inspect the method.1 to 2 minutes
ApplyThe method is not named; translate the information before calculating.2 to 4 minutes
StretchConnect ideas, test a condition, or interpret what the result means.4 to 6 minutes

100 worked discrete math questions

Attempt each question before opening the reasoning. Every item belongs to the same original library used by the workspace above.

Question 1: What is the contrapositive of: If a graph is a tree, then it is connected?

Skill: logic · Level: Build

  1. If a graph is not connected, then it is not a tree.
  2. If a graph is connected, then it is a tree.
  3. If a graph is not a tree, then it is not connected.
  4. Every connected graph is a tree.
Show the worked answer
  1. Write the statement as $P\Rightarrow Q$.
  2. Its contrapositive is $\neg Q\Rightarrow\neg P$: not connected implies not a tree.

Answer: If a graph is not connected, then it is not a tree.

Question 2: How many subsets does a set with $6$ elements have?

Skill: sets and counting · Level: Build

  1. 12
  2. 36
  3. 64
  4. 720
Show the worked answer
  1. There are $2$ choices for each of $6$ elements.
  2. $2^6=64$ subsets.

Answer: 64

Question 3: How many five-character codes use two distinct letters followed by three distinct digits?

Skill: combinatorics · Level: Apply

  1. $26\cdot25\cdot10\cdot9\cdot8$
  2. $26^2\cdot10^3$
  3. $\binom{26}{2}\binom{10}{3}$
  4. $52\cdot30$
Show the worked answer
  1. The letters have $26$ then $25$ choices.
  2. The digits have $10$, $9$, then $8$ choices; multiply all five counts.

Answer: $26\cdot25\cdot10\cdot9\cdot8$

Question 4: A connected graph has $14$ vertices, each of degree $3$. How many edges does it have?

Skill: graph theory · Level: Apply

  1. 18
  2. 21
  3. 28
  4. 42
Show the worked answer
  1. The sum of degrees is $14(3)=42$.
  2. Each edge contributes twice, so $E=42/2=21$.

Answer: 21

Question 5: How many onto functions exist from a $4$-element set to a $2$-element set?

Skill: functions and inclusion-exclusion · Level: Stretch

  1. 12
  2. 14
  3. 16
  4. 24
Show the worked answer
  1. There are $2^4=16$ functions in total.
  2. Exactly two miss one codomain value, so $16-2=14$ are onto.

Answer: 14

Question 6: A recurrence satisfies $a_n=2a_{n-1}+1$ with $a_1=2$. What is $a_5$?

Skill: recurrence relations · Level: Stretch

  1. 31
  2. 47
  3. 63
  4. 95
Show the worked answer
  1. $a_2=5$, $a_3=11$, and $a_4=23$.
  2. $a_5=2(23)+1=47$.

Answer: 47

Question 7: Sets $A$ and $B$ have $11$ and $10$ elements, with $3$ elements in both. Find $|A\cup B|$.

Skill: sets and inclusion-exclusion · Level: Build

  1. 18
  2. 21
  3. 3
  4. 24
Show the worked answer
  1. Add the set sizes: $11+10=21$.
  2. Subtract the $3$ shared elements: $|A\cup B|=18$.

Answer: 18

Question 8: In how many orders can $4$ distinct books be arranged on a shelf?

Skill: permutations · Level: Apply

  1. 16
  2. 12
  3. 25
  4. 24
Show the worked answer
  1. There are $4$ choices, then $3$, continuing to $1$.
  2. The count is $4!=24$.

Answer: 24

Question 9: How many $3$-person committees can be selected from $7$ people?

Skill: combinations · Level: Stretch

  1. 343
  2. 6
  3. 35
  4. 21
Show the worked answer
  1. Use $\binom{7}{3}$.
  2. The number is $35$.

Answer: 35

Question 10: Let $p$ be false and $q$ be false. What is the truth value of $p\to q$?

Skill: propositional logic · Level: Build

  1. both true and false
  2. true
  3. false
  4. cannot be determined
Show the worked answer
  1. Here $p$ is false and $q$ is false.
  2. Therefore $p\to q$ is true.

Answer: true

Question 11: A graph has vertex degrees $2, 3, 4, 5$. If such a graph exists, how many edges does it have?

Skill: graph theory · Level: Apply

  1. 7
  2. 14
  3. 4
  4. 9
Show the worked answer
  1. The degree sum is $14$.
  2. By the handshake lemma, the edge count is $14/2=7$.

Answer: 7

Question 12: A recurrence is $a_0=3$ and $a_n=a_{n-1}+4$. Find $a_{6}$.

Skill: recurrences · Level: Stretch

  1. 23
  2. 7
  3. 24
  4. 27
Show the worked answer
  1. After $6$ steps, the total increase is $6(4)$.
  2. $a_{6}=3+6(4)=27$.

Answer: 27

Question 13: Find $27\bmod 4$.

Skill: modular arithmetic · Level: Build

  1. 1
  2. 7
  3. 3
  4. 6
Show the worked answer
  1. $27=6(4)+3$.
  2. The remainder is $3$.

Answer: 3

Question 14: Write decimal $8$ in binary.

Skill: number representation · Level: Apply

  1. 8
  2. 1000
  3. 1001
  4. 111
Show the worked answer
  1. The powers of two selected by $8$ determine its binary digits.
  2. The binary representation is $1000_2$.

Answer: 1000

Question 15: Among students, $13$ study logic, $11$ study graphs, and $4$ study both. How many study at least one?

Skill: inclusion-exclusion · Level: Stretch

  1. 20
  2. 24
  3. 4
  4. 28
Show the worked answer
  1. $13+11=24$ counts the shared students twice.
  2. Subtract $4$ to get $20$.

Answer: 20

Question 16: If $11$ objects are placed into $4$ boxes, what minimum number must be in at least one box?

Skill: pigeonhole principle · Level: Build

  1. 2
  2. 4
  3. 5
  4. 3
Show the worked answer
  1. $11/4=2.750$.
  2. Rounding up gives $\lceil 11/4\rceil=3$.

Answer: 3

Question 17: Sets $A$ and $B$ have $12$ and $12$ elements, with $4$ elements in both. Find $|A\cup B|$.

Skill: sets and inclusion-exclusion · Level: Apply

  1. 4
  2. 28
  3. 20
  4. 24
Show the worked answer
  1. Add the set sizes: $12+12=24$.
  2. Subtract the $4$ shared elements: $|A\cup B|=20$.

Answer: 20

Question 18: In how many orders can $5$ distinct books be arranged on a shelf?

Skill: permutations · Level: Stretch

  1. 32
  2. 120
  3. 25
  4. 20
Show the worked answer
  1. There are $5$ choices, then $4$, continuing to $1$.
  2. The count is $5!=120$.

Answer: 120

Question 19: How many $4$-person committees can be selected from $8$ people?

Skill: combinations · Level: Build

  1. 70
  2. 32
  3. 4096
  4. 24
Show the worked answer
  1. Use $\binom{8}{4}$.
  2. The number is $70$.

Answer: 70

Question 20: Let $p$ be true and $q$ be false. What is the truth value of $p\to q$?

Skill: propositional logic · Level: Apply

  1. true
  2. cannot be determined
  3. both true and false
  4. false
Show the worked answer
  1. Here $p$ is true and $q$ is false.
  2. Therefore $p\to q$ is false.

Answer: false

Question 21: A graph has vertex degrees $3, 4, 5, 6$. If such a graph exists, how many edges does it have?

Skill: graph theory · Level: Stretch

  1. 4
  2. 11
  3. 9
  4. 18
Show the worked answer
  1. The degree sum is $18$.
  2. By the handshake lemma, the edge count is $18/2=9$.

Answer: 9

Question 22: A recurrence is $a_0=4$ and $a_n=a_{n-1}+5$. Find $a_{7}$.

Skill: recurrences · Level: Build

  1. 35
  2. 39
  3. 34
  4. 9
Show the worked answer
  1. After $7$ steps, the total increase is $7(5)$.
  2. $a_{7}=4+7(5)=39$.

Answer: 39

Question 23: Find $34\bmod 5$.

Skill: modular arithmetic · Level: Apply

  1. 4
  2. 6
  3. 1
  4. 9
Show the worked answer
  1. $34=6(5)+4$.
  2. The remainder is $4$.

Answer: 4

Question 24: Write decimal $11$ in binary.

Skill: number representation · Level: Stretch

  1. 1100
  2. 1010
  3. 11
  4. 1011
Show the worked answer
  1. The powers of two selected by $11$ determine its binary digits.
  2. The binary representation is $1011_2$.

Answer: 1011

Question 25: Among students, $14$ study logic, $12$ study graphs, and $5$ study both. How many study at least one?

Skill: inclusion-exclusion · Level: Build

  1. 5
  2. 31
  3. 21
  4. 26
Show the worked answer
  1. $14+12=26$ counts the shared students twice.
  2. Subtract $5$ to get $21$.

Answer: 21

Question 26: If $12$ objects are placed into $5$ boxes, what minimum number must be in at least one box?

Skill: pigeonhole principle · Level: Apply

  1. 4
  2. 3
  3. 2
  4. 5
Show the worked answer
  1. $12/5=2.400$.
  2. Rounding up gives $\lceil 12/5\rceil=3$.

Answer: 3

Question 27: Sets $A$ and $B$ have $13$ and $14$ elements, with $5$ elements in both. Find $|A\cup B|$.

Skill: sets and inclusion-exclusion · Level: Stretch

  1. 22
  2. 27
  3. 5
  4. 32
Show the worked answer
  1. Add the set sizes: $13+14=27$.
  2. Subtract the $5$ shared elements: $|A\cup B|=22$.

Answer: 22

Question 28: In how many orders can $6$ distinct books be arranged on a shelf?

Skill: permutations · Level: Build

  1. 36
  2. 30
  3. 64
  4. 720
Show the worked answer
  1. There are $6$ choices, then $5$, continuing to $1$.
  2. The count is $6!=720$.

Answer: 720

Question 29: How many $2$-person committees can be selected from $9$ people?

Skill: combinations · Level: Apply

  1. 81
  2. 2
  3. 36
  4. 18
Show the worked answer
  1. Use $\binom{9}{2}$.
  2. The number is $36$.

Answer: 36

Question 30: Let $p$ be false and $q$ be true. What is the truth value of $p\to q$?

Skill: propositional logic · Level: Stretch

  1. both true and false
  2. true
  3. false
  4. cannot be determined
Show the worked answer
  1. Here $p$ is false and $q$ is true.
  2. Therefore $p\to q$ is true.

Answer: true

Question 31: A graph has vertex degrees $4, 5, 6, 7$. If such a graph exists, how many edges does it have?

Skill: graph theory · Level: Build

  1. 11
  2. 22
  3. 4
  4. 13
Show the worked answer
  1. The degree sum is $22$.
  2. By the handshake lemma, the edge count is $22/2=11$.

Answer: 11

Question 32: A recurrence is $a_0=5$ and $a_n=a_{n-1}+6$. Find $a_{8}$.

Skill: recurrences · Level: Apply

  1. 47
  2. 11
  3. 48
  4. 53
Show the worked answer
  1. After $8$ steps, the total increase is $8(6)$.
  2. $a_{8}=5+8(6)=53$.

Answer: 53

Question 33: Find $41\bmod 6$.

Skill: modular arithmetic · Level: Stretch

  1. 1
  2. 11
  3. 5
  4. 6
Show the worked answer
  1. $41=6(6)+5$.
  2. The remainder is $5$.

Answer: 5

Question 34: Write decimal $14$ in binary.

Skill: number representation · Level: Build

  1. 14
  2. 1110
  3. 1111
  4. 1101
Show the worked answer
  1. The powers of two selected by $14$ determine its binary digits.
  2. The binary representation is $1110_2$.

Answer: 1110

Question 35: Among students, $15$ study logic, $13$ study graphs, and $6$ study both. How many study at least one?

Skill: inclusion-exclusion · Level: Apply

  1. 22
  2. 28
  3. 6
  4. 34
Show the worked answer
  1. $15+13=28$ counts the shared students twice.
  2. Subtract $6$ to get $22$.

Answer: 22

Question 36: If $13$ objects are placed into $6$ boxes, what minimum number must be in at least one box?

Skill: pigeonhole principle · Level: Stretch

  1. 2
  2. 6
  3. 4
  4. 3
Show the worked answer
  1. $13/6=2.167$.
  2. Rounding up gives $\lceil 13/6\rceil=3$.

Answer: 3

Question 37: Sets $A$ and $B$ have $14$ and $16$ elements, with $2$ elements in both. Find $|A\cup B|$.

Skill: sets and inclusion-exclusion · Level: Build

  1. 2
  2. 32
  3. 28
  4. 30
Show the worked answer
  1. Add the set sizes: $14+16=30$.
  2. Subtract the $2$ shared elements: $|A\cup B|=28$.

Answer: 28

Question 38: In how many orders can $7$ distinct books be arranged on a shelf?

Skill: permutations · Level: Apply

  1. 128
  2. 5040
  3. 49
  4. 42
Show the worked answer
  1. There are $7$ choices, then $6$, continuing to $1$.
  2. The count is $7!=5040$.

Answer: 5040

Question 39: How many $3$-person committees can be selected from $10$ people?

Skill: combinations · Level: Stretch

  1. 120
  2. 30
  3. 1000
  4. 6
Show the worked answer
  1. Use $\binom{10}{3}$.
  2. The number is $120$.

Answer: 120

Question 40: A graph has vertex degrees $5, 6, 7, 8$. If such a graph exists, how many edges does it have?

Skill: graph theory · Level: Apply

  1. 4
  2. 15
  3. 13
  4. 26
Show the worked answer
  1. The degree sum is $26$.
  2. By the handshake lemma, the edge count is $26/2=13$.

Answer: 13

Question 41: A recurrence is $a_0=6$ and $a_n=a_{n-1}+7$. Find $a_{9}$.

Skill: recurrences · Level: Stretch

  1. 63
  2. 69
  3. 62
  4. 13
Show the worked answer
  1. After $9$ steps, the total increase is $9(7)$.
  2. $a_{9}=6+9(7)=69$.

Answer: 69

Question 42: Find $48\bmod 7$.

Skill: modular arithmetic · Level: Build

  1. 6
  2. 1
  3. 13
  4. 7
Show the worked answer
  1. $48=6(7)+6$.
  2. The remainder is $6$.

Answer: 6

Question 43: Write decimal $17$ in binary.

Skill: number representation · Level: Apply

  1. 10010
  2. 10000
  3. 17
  4. 10001
Show the worked answer
  1. The powers of two selected by $17$ determine its binary digits.
  2. The binary representation is $10001_2$.

Answer: 10001

Question 44: Among students, $16$ study logic, $14$ study graphs, and $3$ study both. How many study at least one?

Skill: inclusion-exclusion · Level: Stretch

  1. 3
  2. 33
  3. 27
  4. 30
Show the worked answer
  1. $16+14=30$ counts the shared students twice.
  2. Subtract $3$ to get $27$.

Answer: 27

Question 45: If $14$ objects are placed into $3$ boxes, what minimum number must be in at least one box?

Skill: pigeonhole principle · Level: Build

  1. 6
  2. 5
  3. 4
  4. 3
Show the worked answer
  1. $14/3=4.667$.
  2. Rounding up gives $\lceil 14/3\rceil=5$.

Answer: 5

Question 46: Sets $A$ and $B$ have $15$ and $18$ elements, with $3$ elements in both. Find $|A\cup B|$.

Skill: sets and inclusion-exclusion · Level: Apply

  1. 30
  2. 33
  3. 3
  4. 36
Show the worked answer
  1. Add the set sizes: $15+18=33$.
  2. Subtract the $3$ shared elements: $|A\cup B|=30$.

Answer: 30

Question 47: In how many orders can $8$ distinct books be arranged on a shelf?

Skill: permutations · Level: Stretch

  1. 64
  2. 56
  3. 256
  4. 40320
Show the worked answer
  1. There are $8$ choices, then $7$, continuing to $1$.
  2. The count is $8!=40320$.

Answer: 40320

Question 48: How many $4$-person committees can be selected from $11$ people?

Skill: combinations · Level: Build

  1. 14641
  2. 24
  3. 330
  4. 44
Show the worked answer
  1. Use $\binom{11}{4}$.
  2. The number is $330$.

Answer: 330

Question 49: A graph has vertex degrees $6, 7, 8, 9$. If such a graph exists, how many edges does it have?

Skill: graph theory · Level: Stretch

  1. 15
  2. 30
  3. 4
  4. 17
Show the worked answer
  1. The degree sum is $30$.
  2. By the handshake lemma, the edge count is $30/2=15$.

Answer: 15

Question 50: A recurrence is $a_0=7$ and $a_n=a_{n-1}+8$. Find $a_{10}$.

Skill: recurrences · Level: Build

  1. 79
  2. 15
  3. 80
  4. 87
Show the worked answer
  1. After $10$ steps, the total increase is $10(8)$.
  2. $a_{10}=7+10(8)=87$.

Answer: 87

Question 51: Find $55\bmod 3$.

Skill: modular arithmetic · Level: Apply

  1. 2
  2. 4
  3. 1
  4. 18
Show the worked answer
  1. $55=18(3)+1$.
  2. The remainder is $1$.

Answer: 1

Question 52: Write decimal $20$ in binary.

Skill: number representation · Level: Stretch

  1. 20
  2. 10100
  3. 10101
  4. 10011
Show the worked answer
  1. The powers of two selected by $20$ determine its binary digits.
  2. The binary representation is $10100_2$.

Answer: 10100

Question 53: Among students, $17$ study logic, $15$ study graphs, and $4$ study both. How many study at least one?

Skill: inclusion-exclusion · Level: Build

  1. 28
  2. 32
  3. 4
  4. 36
Show the worked answer
  1. $17+15=32$ counts the shared students twice.
  2. Subtract $4$ to get $28$.

Answer: 28

Question 54: If $15$ objects are placed into $4$ boxes, what minimum number must be in at least one box?

Skill: pigeonhole principle · Level: Apply

  1. 3
  2. 5
  3. 6
  4. 4
Show the worked answer
  1. $15/4=3.750$.
  2. Rounding up gives $\lceil 15/4\rceil=4$.

Answer: 4

Question 55: Sets $A$ and $B$ have $16$ and $20$ elements, with $4$ elements in both. Find $|A\cup B|$.

Skill: sets and inclusion-exclusion · Level: Stretch

  1. 4
  2. 40
  3. 32
  4. 36
Show the worked answer
  1. Add the set sizes: $16+20=36$.
  2. Subtract the $4$ shared elements: $|A\cup B|=32$.

Answer: 32

Question 56: In how many orders can $3$ distinct books be arranged on a shelf?

Skill: permutations · Level: Build

  1. 7
  2. 6
  3. 9
  4. 8
Show the worked answer
  1. There are $3$ choices, then $2$, continuing to $1$.
  2. The count is $3!=6$.

Answer: 6

Question 57: How many $2$-person committees can be selected from $12$ people?

Skill: combinations · Level: Apply

  1. 66
  2. 24
  3. 144
  4. 2
Show the worked answer
  1. Use $\binom{12}{2}$.
  2. The number is $66$.

Answer: 66

Question 58: Let $p$ be true and $q$ be true. What is the truth value of $p\to q$?

Skill: propositional logic · Level: Stretch

  1. false
  2. cannot be determined
  3. both true and false
  4. true
Show the worked answer
  1. Here $p$ is true and $q$ is true.
  2. Therefore $p\to q$ is true.

Answer: true

Question 59: A graph has vertex degrees $7, 8, 9, 10$. If such a graph exists, how many edges does it have?

Skill: graph theory · Level: Build

  1. 4
  2. 19
  3. 17
  4. 34
Show the worked answer
  1. The degree sum is $34$.
  2. By the handshake lemma, the edge count is $34/2=17$.

Answer: 17

Question 60: A recurrence is $a_0=8$ and $a_n=a_{n-1}+9$. Find $a_{11}$.

Skill: recurrences · Level: Apply

  1. 99
  2. 107
  3. 98
  4. 17
Show the worked answer
  1. After $11$ steps, the total increase is $11(9)$.
  2. $a_{11}=8+11(9)=107$.

Answer: 107

Question 61: Find $62\bmod 4$.

Skill: modular arithmetic · Level: Stretch

  1. 2
  2. 15
  3. 6
  4. 3
Show the worked answer
  1. $62=15(4)+2$.
  2. The remainder is $2$.

Answer: 2

Question 62: Write decimal $23$ in binary.

Skill: number representation · Level: Build

  1. 11000
  2. 10110
  3. 23
  4. 10111
Show the worked answer
  1. The powers of two selected by $23$ determine its binary digits.
  2. The binary representation is $10111_2$.

Answer: 10111

Question 63: Among students, $18$ study logic, $16$ study graphs, and $5$ study both. How many study at least one?

Skill: inclusion-exclusion · Level: Apply

  1. 5
  2. 39
  3. 29
  4. 34
Show the worked answer
  1. $18+16=34$ counts the shared students twice.
  2. Subtract $5$ to get $29$.

Answer: 29

Question 64: If $16$ objects are placed into $5$ boxes, what minimum number must be in at least one box?

Skill: pigeonhole principle · Level: Stretch

  1. 6
  2. 4
  3. 3
  4. 5
Show the worked answer
  1. $16/5=3.200$.
  2. Rounding up gives $\lceil 16/5\rceil=4$.

Answer: 4

Question 65: Sets $A$ and $B$ have $17$ and $22$ elements, with $5$ elements in both. Find $|A\cup B|$.

Skill: sets and inclusion-exclusion · Level: Build

  1. 34
  2. 39
  3. 5
  4. 44
Show the worked answer
  1. Add the set sizes: $17+22=39$.
  2. Subtract the $5$ shared elements: $|A\cup B|=34$.

Answer: 34

Question 66: How many $3$-person committees can be selected from $13$ people?

Skill: combinations · Level: Stretch

  1. 2197
  2. 6
  3. 286
  4. 39
Show the worked answer
  1. Use $\binom{13}{3}$.
  2. The number is $286$.

Answer: 286

Question 67: A graph has vertex degrees $8, 9, 10, 11$. If such a graph exists, how many edges does it have?

Skill: graph theory · Level: Apply

  1. 19
  2. 38
  3. 4
  4. 21
Show the worked answer
  1. The degree sum is $38$.
  2. By the handshake lemma, the edge count is $38/2=19$.

Answer: 19

Question 68: A recurrence is $a_0=9$ and $a_n=a_{n-1}+10$. Find $a_{12}$.

Skill: recurrences · Level: Stretch

  1. 119
  2. 19
  3. 120
  4. 129
Show the worked answer
  1. After $12$ steps, the total increase is $12(10)$.
  2. $a_{12}=9+12(10)=129$.

Answer: 129

Question 69: Find $69\bmod 5$.

Skill: modular arithmetic · Level: Build

  1. 1
  2. 9
  3. 4
  4. 13
Show the worked answer
  1. $69=13(5)+4$.
  2. The remainder is $4$.

Answer: 4

Question 70: Write decimal $26$ in binary.

Skill: number representation · Level: Apply

  1. 26
  2. 11010
  3. 11011
  4. 11001
Show the worked answer
  1. The powers of two selected by $26$ determine its binary digits.
  2. The binary representation is $11010_2$.

Answer: 11010

Question 71: Among students, $19$ study logic, $17$ study graphs, and $6$ study both. How many study at least one?

Skill: inclusion-exclusion · Level: Stretch

  1. 30
  2. 36
  3. 6
  4. 42
Show the worked answer
  1. $19+17=36$ counts the shared students twice.
  2. Subtract $6$ to get $30$.

Answer: 30

Question 72: If $17$ objects are placed into $6$ boxes, what minimum number must be in at least one box?

Skill: pigeonhole principle · Level: Build

  1. 2
  2. 6
  3. 4
  4. 3
Show the worked answer
  1. $17/6=2.833$.
  2. Rounding up gives $\lceil 17/6\rceil=3$.

Answer: 3

Question 73: Sets $A$ and $B$ have $18$ and $24$ elements, with $2$ elements in both. Find $|A\cup B|$.

Skill: sets and inclusion-exclusion · Level: Apply

  1. 2
  2. 44
  3. 40
  4. 42
Show the worked answer
  1. Add the set sizes: $18+24=42$.
  2. Subtract the $2$ shared elements: $|A\cup B|=40$.

Answer: 40

Question 74: How many $4$-person committees can be selected from $14$ people?

Skill: combinations · Level: Build

  1. 1001
  2. 56
  3. 38416
  4. 24
Show the worked answer
  1. Use $\binom{14}{4}$.
  2. The number is $1001$.

Answer: 1001

Question 75: A graph has vertex degrees $9, 10, 11, 12$. If such a graph exists, how many edges does it have?

Skill: graph theory · Level: Stretch

  1. 4
  2. 23
  3. 21
  4. 42
Show the worked answer
  1. The degree sum is $42$.
  2. By the handshake lemma, the edge count is $42/2=21$.

Answer: 21

Question 76: A recurrence is $a_0=10$ and $a_n=a_{n-1}+11$. Find $a_{13}$.

Skill: recurrences · Level: Build

  1. 143
  2. 153
  3. 142
  4. 21
Show the worked answer
  1. After $13$ steps, the total increase is $13(11)$.
  2. $a_{13}=10+13(11)=153$.

Answer: 153

Question 77: Find $76\bmod 6$.

Skill: modular arithmetic · Level: Apply

  1. 4
  2. 12
  3. 2
  4. 10
Show the worked answer
  1. $76=12(6)+4$.
  2. The remainder is $4$.

Answer: 4

Question 78: Write decimal $29$ in binary.

Skill: number representation · Level: Stretch

  1. 11110
  2. 11100
  3. 29
  4. 11101
Show the worked answer
  1. The powers of two selected by $29$ determine its binary digits.
  2. The binary representation is $11101_2$.

Answer: 11101

Question 79: Among students, $20$ study logic, $18$ study graphs, and $3$ study both. How many study at least one?

Skill: inclusion-exclusion · Level: Build

  1. 3
  2. 41
  3. 35
  4. 38
Show the worked answer
  1. $20+18=38$ counts the shared students twice.
  2. Subtract $3$ to get $35$.

Answer: 35

Question 80: If $18$ objects are placed into $3$ boxes, what minimum number must be in at least one box?

Skill: pigeonhole principle · Level: Apply

  1. 8
  2. 6
  3. 3
  4. 7
Show the worked answer
  1. $18/3=6.000$.
  2. Rounding up gives $\lceil 18/3\rceil=6$.

Answer: 6

Question 81: Sets $A$ and $B$ have $19$ and $26$ elements, with $3$ elements in both. Find $|A\cup B|$.

Skill: sets and inclusion-exclusion · Level: Stretch

  1. 42
  2. 45
  3. 3
  4. 48
Show the worked answer
  1. Add the set sizes: $19+26=45$.
  2. Subtract the $3$ shared elements: $|A\cup B|=42$.

Answer: 42

Question 82: How many $2$-person committees can be selected from $15$ people?

Skill: combinations · Level: Apply

  1. 225
  2. 2
  3. 105
  4. 30
Show the worked answer
  1. Use $\binom{15}{2}$.
  2. The number is $105$.

Answer: 105

Question 83: A graph has vertex degrees $10, 11, 12, 13$. If such a graph exists, how many edges does it have?

Skill: graph theory · Level: Build

  1. 23
  2. 46
  3. 4
  4. 25
Show the worked answer
  1. The degree sum is $46$.
  2. By the handshake lemma, the edge count is $46/2=23$.

Answer: 23

Question 84: A recurrence is $a_0=11$ and $a_n=a_{n-1}+12$. Find $a_{14}$.

Skill: recurrences · Level: Apply

  1. 167
  2. 23
  3. 168
  4. 179
Show the worked answer
  1. After $14$ steps, the total increase is $14(12)$.
  2. $a_{14}=11+14(12)=179$.

Answer: 179

Question 85: Find $83\bmod 7$.

Skill: modular arithmetic · Level: Stretch

  1. 1
  2. 13
  3. 6
  4. 11
Show the worked answer
  1. $83=11(7)+6$.
  2. The remainder is $6$.

Answer: 6

Question 86: Write decimal $32$ in binary.

Skill: number representation · Level: Build

  1. 32
  2. 100000
  3. 100001
  4. 11111
Show the worked answer
  1. The powers of two selected by $32$ determine its binary digits.
  2. The binary representation is $100000_2$.

Answer: 100000

Question 87: Among students, $21$ study logic, $19$ study graphs, and $4$ study both. How many study at least one?

Skill: inclusion-exclusion · Level: Apply

  1. 36
  2. 40
  3. 4
  4. 44
Show the worked answer
  1. $21+19=40$ counts the shared students twice.
  2. Subtract $4$ to get $36$.

Answer: 36

Question 88: If $19$ objects are placed into $4$ boxes, what minimum number must be in at least one box?

Skill: pigeonhole principle · Level: Stretch

  1. 4
  2. 6
  3. 7
  4. 5
Show the worked answer
  1. $19/4=4.750$.
  2. Rounding up gives $\lceil 19/4\rceil=5$.

Answer: 5

Question 89: Sets $A$ and $B$ have $20$ and $28$ elements, with $4$ elements in both. Find $|A\cup B|$.

Skill: sets and inclusion-exclusion · Level: Build

  1. 4
  2. 52
  3. 44
  4. 48
Show the worked answer
  1. Add the set sizes: $20+28=48$.
  2. Subtract the $4$ shared elements: $|A\cup B|=44$.

Answer: 44

Question 90: How many $3$-person committees can be selected from $16$ people?

Skill: combinations · Level: Stretch

  1. 560
  2. 48
  3. 4096
  4. 6
Show the worked answer
  1. Use $\binom{16}{3}$.
  2. The number is $560$.

Answer: 560

Question 91: A graph has vertex degrees $11, 12, 13, 14$. If such a graph exists, how many edges does it have?

Skill: graph theory · Level: Apply

  1. 4
  2. 27
  3. 25
  4. 50
Show the worked answer
  1. The degree sum is $50$.
  2. By the handshake lemma, the edge count is $50/2=25$.

Answer: 25

Question 92: A recurrence is $a_0=12$ and $a_n=a_{n-1}+13$. Find $a_{15}$.

Skill: recurrences · Level: Stretch

  1. 195
  2. 207
  3. 194
  4. 25
Show the worked answer
  1. After $15$ steps, the total increase is $15(13)$.
  2. $a_{15}=12+15(13)=207$.

Answer: 207

Question 93: Find $90\bmod 3$.

Skill: modular arithmetic · Level: Build

  1. 0
  2. 30
  3. 3
  4. 1
Show the worked answer
  1. $90=30(3)+0$.
  2. The remainder is $0$.

Answer: 0

Question 94: Write decimal $35$ in binary.

Skill: number representation · Level: Apply

  1. 100100
  2. 100010
  3. 35
  4. 100011
Show the worked answer
  1. The powers of two selected by $35$ determine its binary digits.
  2. The binary representation is $100011_2$.

Answer: 100011

Question 95: Among students, $22$ study logic, $20$ study graphs, and $5$ study both. How many study at least one?

Skill: inclusion-exclusion · Level: Stretch

  1. 5
  2. 47
  3. 37
  4. 42
Show the worked answer
  1. $22+20=42$ counts the shared students twice.
  2. Subtract $5$ to get $37$.

Answer: 37

Question 96: If $20$ objects are placed into $5$ boxes, what minimum number must be in at least one box?

Skill: pigeonhole principle · Level: Build

  1. 7
  2. 4
  3. 5
  4. 6
Show the worked answer
  1. $20/5=4.000$.
  2. Rounding up gives $\lceil 20/5\rceil=4$.

Answer: 4

Question 97: Sets $A$ and $B$ have $21$ and $30$ elements, with $5$ elements in both. Find $|A\cup B|$.

Skill: sets and inclusion-exclusion · Level: Apply

  1. 46
  2. 51
  3. 5
  4. 56
Show the worked answer
  1. Add the set sizes: $21+30=51$.
  2. Subtract the $5$ shared elements: $|A\cup B|=46$.

Answer: 46

Question 98: How many $4$-person committees can be selected from $17$ people?

Skill: combinations · Level: Build

  1. 83521
  2. 24
  3. 2380
  4. 68
Show the worked answer
  1. Use $\binom{17}{4}$.
  2. The number is $2380$.

Answer: 2380

Question 99: A graph has vertex degrees $12, 13, 14, 15$. If such a graph exists, how many edges does it have?

Skill: graph theory · Level: Stretch

  1. 27
  2. 54
  3. 4
  4. 29
Show the worked answer
  1. The degree sum is $54$.
  2. By the handshake lemma, the edge count is $54/2=27$.

Answer: 27

Question 100: A recurrence is $a_0=13$ and $a_n=a_{n-1}+14$. Find $a_{16}$.

Skill: recurrences · Level: Build

  1. 223
  2. 27
  3. 224
  4. 237
Show the worked answer
  1. After $16$ steps, the total increase is $16(14)$.
  2. $a_{16}=13+16(14)=237$.

Answer: 237

Questions about this discrete math practice

What should I do before requesting a hint?

Write the known information, the target, and the relationship you think applies. Even an incomplete setup makes the hint more useful because it exposes the first uncertain decision.

When should I switch to exam pressure?

Use exam mode after you can set up representative questions accurately without prompts. Timing too early can rehearse rushed choices instead of mathematical fluency.

How should I review an incorrect answer?

Find the first wrong decision, state the corrected principle in your own words, and solve a different question before counting the skill as repaired.

Use your exact discrete math question.

Open the tutor →