AMC 10 · 2025 · #17
Grade 6 number-theoryPick an answer.
AMC 10 2025 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.
The words 'leaves a remainder' are hard to use directly, so first rewrite them as clean divisibility facts: subtract each remainder to get a number N divides exactly. Once N divides two numbers, it divides their difference, which shrinks the giant numbers down to a small one. Finding the largest possible N becomes a greatest-common-divisor subproblem, and then the rule N > 16 eliminates all but one divisor.
Turn remainders into exact division
Remainder r means the number minus r is a multiple of N, so subtract: 273436 - 16 = 273420 and 272760 - 15 = 272745.
A remainder is the leftover after fitting whole copies of N, so taking it away leaves an exact stack of N's.
4.NBT.B.6Convert To AlgebraN divides their difference
N divides both of those, so it divides their difference: 273420 - 272745 = 675.
If two numbers are both stacks of N, the gap between them is also a whole number of N's.
If two numbers are both whole stacks of the divisor, so is the gap between them.
▸ Why?
Subtracting two quantities built from the same unit leaves a quantity built from that unit.
▸ Why?
So the gap divides exactly, with no remainder left over.
Find the greatest common divisor
Euclid on 272745 and 675: 272745 = 675 x 404 + 45, then 675 = 45 x 15, so the gcd is 45 and N divides it.
Chasing the remainders downward with division always lands on the largest number that splits both evenly.
4.NBT.B.6Identify SubproblemsUse the remainder rule to pick N
Divisors of 45 are 1, 3, 5, 9, 15, 45; remainder 16 forces N greater than 16, so N = 45.
A remainder can never reach the divisor, so a remainder of 16 forces the divisor past 16 and knocks out every small factor.
4.OA.B.4Eliminate PossibilitiesRead the tens digit
N = 45. Its tens digit is 4, so the answer is (E).
In a two-digit number the left digit counts the tens, so 45 has 4 tens.
2.NBT.A.1Eliminate PossibilitiesSubtract each remainder to get exact multiples, take their difference and its gcd to trap N, then use 'remainder smaller than divisor' to pick the one that fits.
- Turn remainders into exact division
- N divides their difference
- Find the greatest common divisor
- Use the remainder rule to pick N
- Read the tens digit