Elmo makes sandwiches for a fundraiser. For each sandwich he uses globs of peanut butter at per glob and blobs of jam at per blob. The cost of the peanut butter and jam to make all the sandwiches is . Assume that , , and are positive integers with . What is the cost of the jam Elmo uses to make the sandwiches?
- A)
$ 1.05
- B)
$ 1.25
- C)
$ 1.45
- D)
$ 1.65
- E)
$ 1.85
Answer
D
Key insight
In cents, N(4B+5J) = 253 = 11*23; the per-sandwich cost is at least 9 and N > 1, so N = 11, B = 2, J = 3.
Solution
Work in cents. One sandwich costs cents, so all of them cost
Now , and both factors are prime, so must be one of . We are told , and since the per-sandwich cost is at least , which rules out (per-sandwich cost ).
- would need . With , ; with , . No solution.
- needs . With , ; , ; , , so ; makes and . The unique solution is , .
So Elmo makes sandwiches with blobs of jam each: cents.
The answer is .
Why this works
The disguised statement is an integer factorization: a product of unknown positive integers equals a known number, so factor it and test the few divisor splits. Bounds from "positive integers" (per-sandwich cost at least ) and the given prune the cases. The leftover two-variable equation is tiny enough to solve by trying values.
Alternative approach
Mod shortcut: means , so ; only keeps . Similarly needs , impossible since .
The trap
Reporting the jam cost per sandwich (15 cents) or the peanut butter total ($0.88), instead of jam for all 11 sandwiches.
Common mistakes
- Reporting the jam cost per sandwich (15 cents) or the peanut butter total (253 = 11 \cdot 23N = 1$.
Techniques
Bound the quantity above/below or estimate to pin it down · Organized listing / direct enumeration