2020 AMC 10A Problems/Problem 24

Problem

Let $n$ be the least positive integer greater than $1000$ for which $\gcd(63, n+120) =21\quad \text{and} \quad \gcd(n+63, 120)=60.$ What is the sum of the digits of $n$ ?

$\textbf{(A) } 12 \qquad\textbf{(B) } 15 \qquad\textbf{(C) } 18 \qquad\textbf{(D) } 21\qquad\textbf{(E) } 24$

Solution

We know that $gcd(63, n+120)=21$ , so we can write $n+120\equiv0(mod 21)$ . Simplifying, we get $n\equiv6(mod 21)$ . Similarly, we can write $n+63\equiv0(mod60)$ , or $n\equiv-3(mod60)$ . Solving these two modular congruences, $n\equiv237(mod 420)$ which we know is the only solution by CRT (Chinese Remainder Theorem). Now, since the problem is asking for the least positive integer greater than $1000$ , we find the least solution is $n=1077$ . However, we are have not considered cases where $gcd(63, n+120) =63$ or $gcd(n+63, 120) =120$ . $1077+120\equiv0(mod 63)$ so we try $n=1077+420=1497$ .

 so again we add  to . It turns out that  does indeed satisfy the conditions, so our answer is .

Video Solution

https://youtu.be/tk3yOGG2K-s - $Phineas1500$

2020 AMC 10A (Problems • Answer Key • Resources)
Preceded by Problem 23	Followed by Problem 25
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 10 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.

Page

Toolbox

Search

2020 AMC 10A Problems/Problem 24

Contents

Problem

Solution

Video Solution

See Also