Difference between revisions of "2019 AMC 10B Problems/Problem 19"
(I wrote the solution using LaTeX.) |
(→Problem) |
||
| Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
| + | 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 16:26, 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
To find the number of numbers that are the product of two distinct elements of , we first square and factor it. Factoring, we find 
. Therefore, 
has 
distinct factors. Each of these can be achieved by multiplying two factors of . However, the factors must be distinct, so we eliminate 
and , so the answer is 
.
Solution by greersc.
See Also
| 2019 AMC 10B (Problems • Answer Key • Resources) | ||
| Preceded by Problem 18 |
Followed by Problem 20 | |
| 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 10 Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
