2025 AMC 10A Problem 17
Let be the unique positive integer such that dividing by leaves a remainder of and dividing by leaves a remainder of . What is the tens digit of ?
Show solution without answering
Key insight
Take away the remainders: N divides both 273420 and 272745, so it divides 45, their greatest common factor. A remainder of 16 forces N above 16, so N = 45.
Solution
Step 1: get rid of the remainders. "Dividing by leaves remainder " means is more than a multiple of . So subtract the remainder:
- is a multiple of .
- is a multiple of .
Step 2: subtract to get a small number. If two numbers are both multiples of , so is their difference:
So divides .
Step 3: narrow it down with . must also divide . Check which parts of go into it:
- Powers of : ends in , so it is a multiple of but not of (multiples of end in , , or ). So has at most one factor of .
- Powers of : the digit sum is , so is a multiple of . Dividing, , whose digit sum is , not a multiple of . So is not a multiple of , and has at most two factors of .
So divides . The choices for are .
Step 4: use the size of the remainder. A remainder is always smaller than the number you divide by. The remainder means . The only number on the list bigger than is
Step 5: check. , so . And , so . Both remainders are right.
The tens digit of is .
The answer is .
Why this works
A remainder problem becomes a divisibility problem as soon as you subtract the remainder. Then the difference of two multiples of is also a multiple of , which shrinks six-digit numbers down to something small you can factor. Finally, the fact that a remainder is less than the divisor is a free clue that picks out one answer from the short list.
Alternative approach
Find the greatest common factor of and by repeated division (the Euclidean algorithm).
- Their difference is , so the greatest common factor of the two big numbers is the same as that of and .
- Divide: , leaving . So now it is the greatest common factor of and .
- , so divides evenly, and the greatest common factor is .
must divide and be bigger than , so .
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Remove the remainders first. The two conditions say exactly that
So divides any combination of these, in particular their difference:
Now run the Euclidean algorithm on the pair:
Since , the next remainder is , and , so
Hence is a divisor of : one of . A remainder of requires , which leaves only
Check: , so ; and , so . Both conditions hold, and the tens digit of is .
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 1: Integers: The Basics (§1.4, §1.5)
- Introduction to Number Theory, Chapter 4: Prime Factorization (§4.7)
- Introduction to Number Theory, Chapter 5: Divisor Problems (§5.2, §5.3)
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.