Skip to main content

2019 AMC 10B Problem 19

Problem 19 of 25HarderNumber Theory

Let SS be the set of all positive integer divisors of 100,000.100{,}000. How many numbers are the product of two distinct elements of S?S?

Answer choices

Show solution

Solution

First, note that 100,000=2555.100,000=2^5\cdot5^5. Therefore, any element of SS must be of the form 2a5b2^a5^b with 0a,b5.0 \leq a,b \leq 5. Suppose I have distinct x,ySx,y \in S with x=2a5b,x = 2^a5^b,y=2c5d.y=2^c5^d. Then, xy=2a+c5b+d.xy = 2^{a+c}5^{b+d}. Thus, 0a+c,b+d10.0 \leq a+c,b+d \leq 10. This means that there are (10+1)(10+1)=121(10+1)(10+1)=121 possible exponent pairs for a product. However, some products can arise only when x=yx=y, namely when (a,b)=(c,d)(a,b)=(c,d). If a+c=0,a+c=0, then a=0,c=0a=0,c=0 must be true. If a+c=10,a+c=10, then a=5,c=5a=5,c=5 must be true. With any other value of a+c,a+c, we can have ac.a \neq c. Similar structure holds for b+d.b+d. Thus, if a+c,b+d{0,10},a+c,b+d \in \{0,10\}, then (a,b)=(c,d),(a,b)=(c,d), thus making x=y.x=y. This means we have to eliminate 44 choices, leaving 1214=117.121-4=117. Thus, the answer is C .

More practice

Concepts: prime factorization · factor counting

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.