Suzanne went to the bank and withdrew . The teller gave her this amount using bills, bills, and bills, with at least one of each denomination. How many different collections of bills could Suzanne have received?
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
Reduce to 2a + 5b + 10c = 80; b is even, so b = 2k gives a = 40 - 5(k+c) with 2 <= k+c <= 7.
Solution
Let be the numbers of , and bills. Then , or after dividing by ,
Every term except is even, so is even: write with . Dividing by ,
Since , we need ; since , we need . Each pair with determines , and there are such pairs. Summing over :
The answer is .
Why this works
Divisibility shrinks the search: the bills must come in pairs because everything else is a multiple of . After the substitution the equation has a single free combination , and counting positive pairs with a given sum is routine. Handle the "at least one" restriction by building it into the variable ranges from the start.
Alternative approach
Casework on : for the remaining dollars must be made from twenties and an even number of fifties, giving options respectively, again .
The trap
Ignoring 'at least one of each denomination', which allows zero counts and inflates the total to 45.
Common mistakes
- Ignoring 'at least one of each denomination', which allows zero counts and inflates the total to 45.
- Forgetting that must be even and counting odd values of that leave an odd number of tens.
Techniques
Organized listing / direct enumeration · Substitute to simplify (u = x+1/x, shifting, scaling)