One fair die has faces and another has faces The dice are rolled and the numbers on the top faces are added. What is the probability that the sum will be odd?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
The sum is odd only when one die is odd and the other even. The first die is odd 2/3 of the time, the second only 1/3.
Solution
Whether a sum is odd depends only on whether each number is odd or even: odd + even is odd, but odd + odd and even + even are both even.
- First die (): four odd faces () and two even faces. So it is odd with probability and even with probability .
- Second die (): two odd faces () and four even faces. So it is odd with probability and even with probability .
- Case 1: first odd, second even. Probability .
- Case 2: first even, second odd. Probability .
- These two cases cannot both happen, so add them: .
The answer is .
Why this works
For "is the sum odd or even?" questions, replace each number by just "odd" or "even." That turns each die into a simple two-outcome coin, but a lopsided one, so count the faces carefully. Unusual dice like these are made on purpose so that the guess is wrong.
Alternative approach
Find the chance the sum is even, then subtract from . Even happens when both dice are odd () or both are even (). That is , so an odd sum has probability .
The trap
Assuming each die is odd half the time and answering 1/2. These dice have more of one kind of face than the other.
Concise solution
Only parity matters: a sum is odd exactly when one die is odd and the other is even.
First die (): four odd faces, two even, so and .
Second die (): two odd faces, four even, so and .
The two dice are independent, so
The answer is .
Review in the AoPS books
- Introduction to Counting & Probability, Chapter 7: Introduction to Probability
- Introduction to Number Theory, Chapter 1: Integers: The Basics
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.2)
- Introduction to Counting & Probability, Chapter 8: Basic Probability Techniques
Techniques
Split into exhaustive cases and handle each · Use an invariant, parity, or coloring argument