πŸ‡ΊπŸ‡Έ AMC 8 ⇄ switch contest
1987 AJHSME

Problem 8

Problem 8 · 1987 AJHSME Medium
Number Theory bound-the-sum
Figure for AJHSME 1987 Problem 8
Show answer
Answer: B — 5.
Show hints
Hint 1 of 2
Answer (E) tempts you to think the digit count wobbles with A and B. Don't guess β€” pin down the smallest and largest the sum could ever be.
Still stuck? Show hint 2 →
Hint 2 of 2
Push A and B to their extremes: both as small as allowed (1) for the minimum, both 9 for the maximum. If both ends have the same digit count, every value in between does too.
Show solution
Approach: bracket the sum between its extremes
  1. A and B are digits, and 'nonzero' means each is at least 1. Smallest sum: 9876 + 132 + 11 = 10019. Largest sum: 9876 + 932 + 91 = 10899.
  2. Both endpoints land between 10000 and 99999, so the sum has 5 digits no matter what A and B are β€” that's why the answer isn't (E).
  3. Why this transfers: to test whether an answer 'depends' on a free choice, squeeze the choice to its extremes. If the extremes agree, nothing in between can disagree.
Mark: · log in to save