AMC 10 · 2019 · #14

Grade 6 number-theory
divisor-countprime-factorizationcombinatorial-identityexponents complementary-countingidentify-subproblems ↑ Prerequisites: divisor-countprime-factorization
📏 Long solution 💡 4 insights
Problem
Let a set hold every positive divisor of one hundred thousand. Count how many distinct numbers can be written as the product of two different elements of that set.

Pick an answer.

(A)
98
(B)
100
(C)
117
(D)
119
(E)
121
How to solve
Strategy Change Focus / Count the Complement

Tool #16 (Complement): list ALL candidate values (divisors of 10¹⁰, which is 11 · 11 = 121) and subtract the few that cannot be written as a product of two distinct divisors of 10⁵. Tool #7 (Subproblems): a product of two divisors has the form 2^a · 5^b with 0 ≤ a, b ≤ 10 — so the question splits into "which (a, b) pairs are reachable?" Tool #9 (Easier Problem): the same kind of question on 100 = 2² · 5² first, then generalize.

1STEP 1

Count the candidates

Two exponent ranges give the candidates.

candidates = 11 · 11 = 121
2STEP 2

State the condition in exponents

The two elements must differ.

a₁ + a₂ = A, b₁ + b₂ = B, 0 ≤ a_i, b_i ≤ 5, (a₁,b₁) ≠ (a₂,b₂)
3STEP 3

Check the smallest product

One needs the same element twice.

2⁰ · 5⁰ = 1 (impossible — forces (0,0) · (0,0))
4STEP 4

Check the largest product

The largest fails for the same reason.

2¹⁰ · 5¹⁰ (impossible — forces both = 10⁵)
5STEP 5

Check the extreme exponents

A single extreme exponent is blocked too.

2¹⁰ (impossible — forces both = 32)
6STEP 6

Check the other extreme

The other side is blocked by symmetry.

5¹⁰ (impossible — forces both = 3125)
7STEP 7

Collect the impossible cases

Only four cases are blocked.

bad = {(0,0), (10,0), (0,10), (10,10)}, |bad| = 4
8STEP 8

Subtract to finish

Subtracting gives 117.

121 - 4 = 117
Answer
117
117 is between choices 100 and 119, and exactly 121 - 4, where 121 is the count of divisors of 100,000² and 4 is the count of corners that need twin factorizations. Sanity check on a smaller case: divisors of 100 = 2² · 5² are 9 in number; products of two distinct divisors live among divisors of 10⁴ (25 candidates); bad corners are the same four ((0,0), (4,0), (0,4), (4,4)); so the answer for 100 would be 25 - 4 = 21, which matches a direct enumeration.
💡Key takeaway

This AMC 12 problem only needs Grade 6 prime-factorization reasoning you already know — every divisor of 10⁵ is 2^a · 5^b, so products live among the 121 divisors of 10¹⁰, and only 4 "corner" values fail the distinct-pair rule. 121 - 4 = 117. The answer is (C).