The town of Hamlet has people for each horse, sheep for each cow, and ducks for each person. Which of the following could not possibly be the total number of people, horses, sheep, cows, and ducks in Hamlet?
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
With h horses and c cows the total is 13h + 5c. Take 13s away from each choice and look for a multiple of 5.
Solution
1. Count everything using horses and cows. Say there are horses and cows.
- people per horse gives people.
- ducks per person gives ducks.
- sheep per cow gives sheep.
2. Add them up.
So the total is some number of s plus some number of s.
3. Test each choice. Take away zero, one, two or more times, and see whether what is left is a multiple of (ends in or ):
| Total | Take away | Works? |
|---|---|---|
| yes: , so , | ||
| no: none ends in or | ||
| yes: , | ||
| yes: , | ||
| yes: , |
For we cannot take away more s, because is negative.
The only total that cannot happen is .
The answer is .
Why this works
Each "so many of these for each of those" fact ties one count to another, so the whole town depends on just two numbers, horses and cows. The total becomes . Because one of the numbers is , checking a total only needs its last digit after taking away s, which makes the test quick.
The trap
Applying a ratio to the wrong animal, for example 3 ducks per horse instead of 3 ducks per person. The ducks come from the people, so there are 9 ducks for each horse.
Concise solution
Let there be horses and cows. Then there are people, ducks, and sheep. The total is
where and are non-negative integers.
A total is possible exactly when is a non-negative multiple of for some . Since only the last digit matters for divisibility by , subtract and look for a result ending in or :
- : . Possible (, ).
- : — none ends in or . Impossible.
- : . Possible.
- : . Possible.
- : . Possible.
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 7: Algebra With Integers
- Introduction to Algebra, Chapter 3: One-Variable Linear Equations (§3.3, §3.4)
- Prealgebra, Chapter 15: Problem-Solving Strategies (§15.2)
- Introduction to Algebra, Chapter 11: Special Factorizations (§11.5)
Techniques
Use the answer choices (mod checks, size, form) to eliminate or select · Organized listing / direct enumeration