Let be an ordered quadruple of not necessarily distinct integers, each one of them in the set For how many such quadruples is it true that is odd? (For example, is one such quadruple, because is odd.)
- A)
- B)
- C)
- D)
- E)
Answer
C
Key insight
ad - bc is odd exactly when one product is odd and the other even; a product is odd for 4 of 16 pairs, so 2(4)(12) = 96.
Solution
A difference is odd exactly when its two terms have opposite parity, so we need one of , odd and the other even.
Count ordered pairs from ( pairs) by the parity of . The product is odd only when both factors are odd, and each has odd choices: pairs. The remaining pairs give an even product. The same counts hold for .
Quadruples with odd and even: . Quadruples with even and odd: . Total
The answer is .
Why this works
Only parity matters, and the set contains two evens and two odds, so parity behaves like a fair coin for each entry. "Odd minus even" and "even minus odd" are symmetric, which halves the work. Recognizing that oddness of a product requires all factors odd is the whole computation.
Alternative approach
Probability view: each of , is odd with probability , independently. The difference is odd with probability , and .
The trap
Counting only the case ad odd and bc even (48) and forgetting the symmetric case, or working with parities alone without multiplying by 2 for each digit.
Common mistakes
- Counting only the case ad odd and bc even (48) and forgetting the symmetric case, or working with parities alone without multiplying by 2 for each digit.
- Believing is odd half the time (giving ).
Techniques
Use an invariant, parity, or coloring argument · Exploit symmetry to reduce work or pair up objects