AMC 10 · 2024 · #7

Grade 6 number-theory
modular-arithmeticexponentspattern-recognition identify-subproblemspattern-recognition ↑ Prerequisites: modular-arithmeticexponents
📏 Short solution 💡 2 insights
Problem
Find the remainder when the sum 7²⁰²⁴ + 7²⁰²⁵ + 7²⁰²⁶ is divided by 19.

Pick an answer.

(A)
0
(B)
1
(C)
7
(D)
11
(E)
18

AMC 10 2024 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.

How to solve
Strategy Convert to Algebra

The three terms all share 7²⁰²⁴, so the algebra move is to factor it out and inspect the bracket 1 + 7 + 7². That is Tool #13 (Convert to Algebra) in its cleanest form — a numerical sum becomes a product whose individual factors can be checked for divisibility one at a time. Tool #7 (Identify Subproblems) then breaks the divisibility question into two pieces: compute 1 + 7 + 49 = 57, then check whether 57 is divisible by 19. If yes, the whole sum is divisible by 19 regardless of what 7²⁰²⁴ equals, and the remainder is 0.

1STEP 1

Factor the smallest power 7²⁰²⁴ out of all three terms, turning the sum into one product.

7²⁰²⁴ + 7²⁰²⁵ + 7²⁰²⁶ = 7²⁰²⁴(1 + 7 + 7²)
2STEP 2

Subproblem A: evaluate the bracket by hand — 1 + 7 + 49 gives 57.

1 + 7 + 7² = 1 + 7 + 49 = 57
3STEP 3

Subproblem B: 57 is a multiple of 19 because 57 = 3 × 19.

57 = 3 × 19
4STEP 4

Put 57 = 3 × 19 back, and 19 becomes a factor of the whole sum, so the remainder is 0.

7²⁰²⁴ + 7²⁰²⁵ + 7²⁰²⁶ = 7²⁰²⁴ × 3 × 19 → remainder = 0 → (A)
Answer
0
Cross-check with modular arithmetic: 7² = 49 = 2 × 19 + 11, so 7² ≡ 11 (mod 19). Then 7³ ≡ 7 · 11 = 77 = 4 × 19 + 1, so 7³ ≡ 1 (mod 19). Three consecutive powers 7²⁰²⁴, 7²⁰²⁵, 7²⁰²⁶ cycle through values {7^a, 7^a · 7, 7^a · 7²} which sum to 7^a(1 + 7 + 49) ≡ 7^a · 57 ≡ 7^a · 0 = 0 (mod 19). Same answer (A).
💡Key takeaway

This AMC 10 problem only needs Grade 6 factoring — pull the common power out, check whether 19 divides the small leftover, and you don't need to compute any huge power at all!