2017 AMC 10B Problems/Problem 20
Problem
The number
has over
positive integer divisors. One of them is chosen at random. What is the probability that it is odd?
Solution 1
We note that the only thing that affects the parity of the factor are the powers of 2. There are
factors of 2 in the number. Thus, there are
cases in which a factor of
would be even (have a factor of
in its prime factorization), and
case in which a factor of
would be odd. Therefore, the answer is
.
Note from Williamgolly: To see why symmetry occurs here, we group the factors of 21! into 2 groups, one with powers of 2 and the others odd factors. For each power of 2, the factors combine a certain number of 2's from the first group and numbers from the odd group. That is why symmetry occurs here.
Solution 2 (Legendre's and Substitution)
Use Legendre's formula to derive the prime factorization of
.
How can this be done? The greatest prime factor before
is
, so use Legendre's formula for all prime numbers up until
inclusive of
. Then, if you do the steps correctly, your prime factorization should be
We want \(\frac{P(\text{odd})}{P(\text{All})}\). To get \(P(\text{odd})\), we want all the factors of
Why not
? Well, anything multiplied by 2 is going to be even, which we don't want.
Using the number of factors formula, the number of factors that divide
including 1 and
is
.
For simplicity, denote this product as \(\aleph\). Then,
is the number of odd factors in
.
We now want \(P(\text{all})\). This is just the number of factors in
(While they do say this is
in the problem, for the sake of substitution reasons let's ignore this fact). Then, the number of factors is \((18+1)(9+1)(4+1)(3+1)(2^4)\). We substitute
and see that
The probability that we pick an odd divisor of
is
, or
, or
.
~Pinotation
Solution 3 (Constructive Counting)
Consider how to construct any divisor
of
. First by Legendre's theorem for the divisors of a factorial (see here: Legendre's Formula), we have that there are a total of 18 factors of 2 in the number.
can take up either 0, 1, 2, 3,..., or all 18 factors of 2, for a total of 19 possible cases. In order for
to be odd, however, it must have 0 factors of 2, meaning that there is a probability of 1 case/19 cases =
Solution 4
We can find the prime factorization of
. We do this by finding the prime factorization of each of 21, 20, ..., 2, and 1 and multiplying them together. This gives us
. To find the number of odd divisors, we pretend as if the
doesn't exist and count the other divisors:
. The total number of divisors are
. Dividing gives
.
See Also
| 2017 AMC 10B (Problems • Answer Key • Resources) | ||
| Preceded by Problem 19 |
Followed by Problem 21 | |
| 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 | ||
| 2017 AMC 12B (Problems • Answer Key • Resources) | |
| Preceded by Problem 15 |
Followed by Problem 17 |
| 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 | |
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. Error creating thumbnail: Unable to save thumbnail to destination