2020 AMC 10A Problem 24
Let be the least positive integer greater than for which What is the sum of the digits of ?
Show solution without answering
Key insight
Each gcd says a number divides and a bigger power does not. The dividing parts give n = 237 plus multiples of 420; test 1077, 1497, 1917.
Solution
Each gcd condition contains a "must divide" part and a "must not go further" part. Use the first parts to list candidates, then use the second parts to throw candidates out.
1. First condition. . For to be exactly , the number must be a multiple of but not a multiple of (otherwise the gcd would be ).
2. Second condition. and . For to be exactly , the number must be a multiple of but not a multiple of (otherwise the gcd would be ).
3. List numbers with a multiple of . Then is plus a multiple of , so (each more than the last).
4. Which of these make a multiple of ? Check them: (no), (no), (no), (yes). So works for both "divides" parts.
5. The pattern repeats every . Adding keeps a multiple of and a multiple of , since . And is the smallest step that does both. So the candidates above are , then , then , and so on.
6. Test the "not further" parts.
- : . Its digits add to , so it is a multiple of . The gcd would be . Throw it out.
- : , digits add to , fine. But , a multiple of . The gcd would be . Throw it out.
- : , digits add to , not a multiple of . Good. , and , not a whole number. Good. So .
7. The digits of add to .
The answer is .
Why this works
"The gcd is exactly " means divides the number, and the extra prime factors that would make the gcd bigger do not. The "divides" parts combine into one repeating list of candidates; the "does not divide" parts are easiest to use as a final check on just a few candidates.
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Translate each gcd. with means but . with means but .
Divisibility parts: and . Write ; then , so , i.e. , giving . So .
Candidates above : . Check the exclusions:
- : , digit sum , divisible by . Then . Rejected.
- : (digit sum , fine), but , so . Rejected.
- : , digit sum , not divisible by ; , and is not a multiple of . Both gcds are exactly and . Accepted.
Digit sum of : .
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 3: Multiples and Divisors (§3.3, §3.4, §3.7)
- Introduction to Number Theory, Chapter 12: Introduction to Modular Arithmetic
- Prealgebra, Chapter 15: Problem-Solving Strategies (§15.2)
- Introduction to Number Theory, Chapter 4: Prime Factorization (§4.7)
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.