Discrete Math Quiz: Sum And Product Rules

9 questions · exam conditions

0:00

Sum And Product RulesQuestion 1 of 9

A university club is organizing teams for a competition. Each team needs exactly 2 members: one leader and one supporter. There are 8 potential leaders and 12 potential supporters, but 3 specific leader-supporter pairs cannot work together due to scheduling conflicts. Using the given constraints, how many different teams can be formed?

8 \times 12 - 3 = 93

(8-3) \times 12 = 60

8 \times (12-3) = 72

8 + 12 - 3 = 17

← Back to quizzes

Discrete Math Quiz

Discrete Math Quiz: Sum And Product Rules

Practice Sum And Product Rules in Discrete Math with focused quiz questions that help you check what you know, review explanations, and build confidence with test-style prompts.

What this quiz covers

This quiz focuses on Sum And Product Rules, giving you a quick way to practice the rules, question types, and explanations that matter most for Discrete Math.

How to use this quiz

Try each quiz question before looking at the correct answer. Use the explanations to review missed ideas, then come back to similar questions until the pattern feels familiar.

All questions

Question 1

$8 \times 12 - 3 = 93$ (correct answer)
$(8-3) \times 12 = 60$
$8 \times (12-3) = 72$
$8 + 12 - 3 = 17$

Explanation: Using the product rule with restrictions: Total possible teams without restrictions = 8 leaders × 12 supporters = 96 teams. Then subtract the 3 forbidden pairs: 96 - 3 = 93. Choice B incorrectly assumes 3 leaders are completely unavailable. Choice C incorrectly assumes 3 supporters are completely unavailable. Choice D incorrectly uses the sum rule instead of the product rule for team formation.

Question 2

A survey asks respondents to rank their top 3 favorite colors from a list of 8 colors, where order matters and no color can be repeated. Additionally, respondents can choose to skip the survey entirely. If 200 people are approached, and exactly 40 people skip the survey, how many total possible outcomes exist for this scenario?

$200 \times 8 \times 7 \times 6 + 40 = 672,040$
$160 \times (8 \times 7 \times 6) + 40 = 53,880$
$160 \times 8 \times 7 \times 6 + 1 = 53,761$
$(200-40) \times 8 \times 7 \times 6 = 53,760$ (correct answer)

Explanation: Since exactly 40 people skip, exactly 160 people complete the survey. Each person who completes the survey chooses 3 colors in order: first color (8 choices), second color (7 choices), third color (6 choices). Total outcomes = 160 × 8 × 7 × 6 = 53,760. Choice A incorrectly multiplies all 200 people by the color choices. Choice B adds 40 instead of accounting for the constraint. Choice C adds 1 unnecessarily, treating 'skip' as an additional outcome rather than a given constraint.

Question 3

A smartphone app allows users to create custom notification sounds by selecting a sequence of exactly 3 tones from 6 available tones (A, B, C, D, E, F). Repetition of tones is allowed, but the sequence cannot start and end with the same tone. How many different notification sounds can be created?

$6 \times 6 \times 5 = 180$
$6 \times 5 \times 4 = 120$
$6^3 - 6 \times 6 = 180$ (correct answer)
$6^3 - 6 = 210$

Explanation: When you encounter counting problems with restrictions, the key strategy is often to calculate the total unrestricted possibilities first, then subtract the cases that violate the constraints. Here, you need 3-tone sequences where repetition is allowed but the first and last tones must be different. Start with the unrestricted case: since repetition is allowed and you have 6 tones for each of the 3 positions, there are

6^3 = 216

total possible sequences. Now identify what needs to be subtracted. The restriction eliminates sequences that start and end with the same tone. For any specific tone (say A), you can have A in the first position, any of the 6 tones in the middle position, and A in the last position. That's

1 \times 6 \times 1 = 6

sequences per starting tone. Since there are 6 possible starting tones, you have

6 \times 6 = 36

sequences to subtract. Therefore, the answer is

6^3 - 6 \times 6 = 216 - 36 = 180

. Choice A (

6 \times 6 \times 5 = 180

) gets the right number by coincidence but uses flawed reasoning—it restricts the last position to 5 choices regardless of what the first two positions contain. Choice B (

6 \times 5 \times 4 = 120

) incorrectly assumes no repetition is allowed at all. Choice D (

6^3 - 6 = 210

) only subtracts 6, which would mean only 6 forbidden sequences exist. Remember: when dealing with restrictions in counting problems, "total minus forbidden" is often clearer than trying to count valid cases directly.

Question 4

A game show contestant must choose doors to open in a hallway. The hallway has 3 sections: Section A has 4 doors, Section B has 5 doors, and Section C has 3 doors. The contestant wins if they open at least one door from Section A or at least one door from Section C, but they lose if they open any door from Section B. If the contestant must open exactly 2 doors total, how many winning strategies exist?

$\binom{4}{2} + \binom{3}{2} + (4 \times 3) = 21$ (correct answer)
$\binom{4}{2} + \binom{3}{2} = 9$
$\binom{7}{2} = 21$
$4 \times 3 \times 2 = 24$

Explanation: Using the sum rule for mutually exclusive winning cases: Case 1: Both doors from Section A = C(4,2) = 6 ways. Case 2: Both doors from Section C = C(3,2) = 3 ways. Case 3: One door from Section A and one from Section C = 4 × 3 = 12 ways. Total = 6 + 3 + 12 = 21 ways. Choice B omits the mixed case. Choice C incorrectly treats sections A and C as one combined section of 7 doors. Choice D uses incorrect multiplication.

Question 5

A restaurant offers a prix fixe menu where customers choose exactly one item from each of three courses. The appetizer course has 4 options, the main course has 6 options, and the dessert course has 5 options. However, certain combinations are not available: if a customer chooses the vegetarian appetizer, they cannot choose either of the two meat-based main courses. How many different complete meals are possible?

$4 \times 6 \times 5 - 1 \times 2 \times 5 = 110$
$3 \times 6 \times 5 + 1 \times 4 \times 5 = 110$ (correct answer)
$4 \times 6 \times 5 - 2 \times 5 = 110$
$4 \times 5 \times 5 = 100$

Explanation: Using the sum rule to separate cases: Case 1: Non-vegetarian appetizer (3 choices) with any main course (6 choices) and any dessert (5 choices) = 3 × 6 × 5 = 90. Case 2: Vegetarian appetizer (1 choice) with non-meat main courses (6 - 2 = 4 choices) and any dessert (5 choices) = 1 × 4 × 5 = 20. Total = 90 + 20 = 110. Choice A uses incorrect subtraction approach. Choice C incorrectly subtracts only 2 × 5. Choice D miscounts main courses as 5 instead of 6.

Question 6

A coding contest has three problems: Easy, Medium, and Hard. Contestants can attempt problems in any order, but must solve at least one problem to receive a score. There are 4 different approaches to solve the Easy problem, 3 approaches for Medium, and 2 approaches for Hard. If a contestant decides to attempt exactly 2 problems, how many different ways can they complete their chosen problems?

$\binom{3}{2} \times 4 \times 3 \times 2 = 72$
$4 \times 3 + 4 \times 2 + 3 \times 2 = 26$ (correct answer)
$(4 \times 3) + (4 \times 2) + (3 \times 2) = 26$
$2 \times (4 + 3 + 2) = 18$

Explanation: Using the sum rule for three mutually exclusive cases: Case 1: Easy and Medium = 4 × 3 = 12 ways. Case 2: Easy and Hard = 4 × 2 = 8 ways. Case 3: Medium and Hard = 3 × 2 = 6 ways. Total = 12 + 8 + 6 = 26. Choice A incorrectly uses combinations then multiplies by all approach counts. Choice C shows the same calculation as B but might confuse order of operations. Choice D incorrectly treats this as 2 problems chosen from a sum rather than specific pairs.

Question 7

A computer science student is creating test cases for a function that takes exactly 3 parameters: an integer from 1-5, a boolean value (true/false), and a character from the set {A, B, C}. However, certain combinations crash the system: any combination with integer 1 and boolean true, regardless of character choice. How many safe test cases can the student create?

$5 \times 2 \times 3 - 1 \times 1 \times 3 = 27$ (correct answer)
$4 \times 2 \times 3 + 1 \times 1 \times 3 = 27$
$(5-1) \times 2 \times 3 = 24$
$5 \times 1 \times 3 + 4 \times 2 \times 3 = 39$

Explanation: Using complementary counting: Total possible test cases = 5 integers × 2 boolean values × 3 characters = 30. Unsafe combinations (integer 1, boolean true, any character) = 1 × 1 × 3 = 3. Safe test cases = 30 - 3 = 27. Choice B incorrectly uses addition instead of subtraction for complement. Choice C incorrectly removes integer 1 entirely from consideration. Choice D uses an incorrect partitioning approach that doesn't properly handle the restriction.

Question 8

A mathematics department is scheduling final exams in 4 time slots. There are 12 courses that need exams, but 5 of these courses are advanced courses that can only be scheduled in the last 2 time slots due to prerequisite requirements. If each time slot can accommodate any number of courses, how many ways can the courses be assigned to time slots?

$4^{12} - 2^5 = 16,744,768$
$4^{12} - 4^7 \times 2^5 = 16,252,416$
$4^7 \times 2^5 = 524,320$ (correct answer)
$2^5 \times 4^7 = 524,320$

Explanation: When you encounter scheduling problems with constraints, the key is to identify which items have restrictions and handle them separately from those that don't. This problem has two distinct groups: 7 regular courses that can go in any of the 4 time slots, and 5 advanced courses restricted to only the last 2 time slots. Since these groups have different constraints, you multiply their possibilities together. For the 7 regular courses, each can be assigned to any of the 4 time slots independently, giving us

4^7

arrangements. For the 5 advanced courses, each can only go in one of the 2 allowed time slots, giving us

2^5

arrangements. The total number of ways is

4^7 \times 2^5 = 16,384 \times 32 = 524,320

. Answer A attempts to use inclusion-exclusion but incorrectly calculates

4^{12} - 2^5

, which doesn't properly account for the constraint structure. Answer B uses a more complex inclusion-exclusion approach (

4^{12} - 4^7 \times 2^5

) that overcomplicates the problem and applies the wrong logic. Answer D correctly identifies the components (

2^5 \times 4^7

) but presents them in reverse order, though mathematically this gives the same result as C due to the commutative property of multiplication. When facing constrained assignment problems, always separate items by their restriction levels and calculate possibilities for each group independently. Then multiply these possibilities together using the multiplication principle. This systematic approach prevents the overcounting errors that inclusion-exclusion methods often introduce in these contexts.

Question 9

A computer network administrator needs to assign unique passwords to employees. Each password must contain exactly 3 uppercase letters followed by exactly 2 digits, where the first digit cannot be 0. However, the letters X, O, and I are forbidden due to confusion with numbers. If no repetition of letters or digits is allowed within a single password, how many valid passwords can be created?

$23 \times 22 \times 21 \times 9 \times 9 = 873,180$
$23^3 \times 9 \times 9 = 1,030,959$
$26 \times 25 \times 24 \times 9 \times 9 = 1,263,600$
$23 \times 22 \times 21 \times 9 \times 8 = 698,544$ (correct answer)

Explanation: Using the product rule: For letters, we have 26 - 3 = 23 available letters. First letter: 23 choices. Second letter: 22 choices (no repetition). Third letter: 21 choices. For digits, first digit cannot be 0: 9 choices (1-9). Second digit: 8 choices (0-9 except the first digit used). Total: 23 × 22 × 21 × 9 × 8 = 698,544. Choice A incorrectly uses 9 × 9 for digits, allowing repetition. Choice B incorrectly allows letter repetition (23³). Choice C ignores the forbidden letters restriction.