Difference between revisions of "2019 AMC 12B Problems/Problem 14"
Mathinator1 (talk | contribs) m (→Solution: correction to exponent formatting) |
Scrabbler94 (talk | contribs) (→Problem: add choices) |
||
| Line 2: | Line 2: | ||
Let <math>S</math> be the set of all positive integer divisors of <math>100,000.</math> How many numbers are the product of two distinct elements of <math>S?</math> | Let <math>S</math> be the set of all positive integer divisors of <math>100,000.</math> How many numbers are the product of two distinct elements of <math>S?</math> | ||
| + | |||
| + | <math>\textbf{(A) }98\qquad\textbf{(B) }100\qquad\textbf{(C) }117\qquad\textbf{(D) }119\qquad\textbf{(E) }121</math> | ||
==Solution== | ==Solution== | ||
Revision as of 14:31, 14 February 2019
Problem
Let 
be the set of all positive integer divisors of 
How many numbers are the product of two distinct elements of 
Solution
First, find the prime factorization of 
. It is 
. Thus, any factor will have the pattern 
, where 
. Multiplying this by another factor with the same pattern 
gets us 
. It initially seems like we have 
options for the power of 
and options for the power of 
, giving us a total of 
choices. However, note that the factors must be distinct. If they are distinct, we cannot have 
(as it is only formed by 
), or 
(as it is only formed by 
). These are the only two cases where the distinction rule forces us to eliminate cases, and therefore the answer is 
- Robin's solution
See Also
| 2019 AMC 12B (Problems • Answer Key • Resources) | |
| Preceded by Problem 13 |
Followed by Problem 15 |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
| All AMC 12 Problems and Solutions | |
