The number 1 5 ! is equal to 1,307,674,368,000. Given that this number has more than 4,000 positive divisors, what is the probability of a randomly selected divisor being odd?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The prime factorization of 1 3 0 7 6 7 4 3 6 8 0 0 0 is 2 1 1 ⋅ 3 6 ⋅ 5 3 ⋅ 7 2 ⋅ 1 1 1 ⋅ 1 3 1 .
The probability of a divisor being odd is ( 1 1 + 1 ) ( 6 + 1 ) ( 3 + 1 ) ( 2 + 1 ) ( 1 + 1 ) ( 1 + 1 ) ( 6 + 1 ) ( 3 + 1 ) ( 2 + 1 ) ( 1 + 1 ) ( 1 + 1 ) = 1 2 1
Problem Loading...
Note Loading...
Set Loading...
Recall that a number N with prime factorization
p 1 q 1 p 2 q 2 p 3 q 3 p 4 q 4 ⋯ p k q k
has ( q 1 + 1 ) ( q 2 + 1 ) ( q 3 + 1 ) ( q 4 + 1 ) ⋯ ( q k + 1 ) factors .
Now,
1 5 ! = 2 1 1 × 3 6 × 5 3 × 7 2 × 1 1 × 1 3
has ( 1 1 + 1 ) ( 6 + 1 ) ( 3 + 1 ) ( 2 + 1 ) ( 1 + 1 ) ( 1 + 1 ) factors.
For the product of two numbers to be odd, they must both be odd, so the odd factors of 1 5 ! must be all possible combinations of products of its odd prime factors - namely, 3 , 5 , 7 , 1 1 , and 1 3 . Thus, 1 5 ! has ( 6 + 1 ) ( 3 + 1 ) ( 2 + 1 ) ( 1 + 1 ) ( 1 + 1 ) odd factors, making the probability that a randomly selected factor is odd
( 1 1 + 1 ) ( 6 + 1 ) ( 3 + 1 ) ( 2 + 1 ) ( 1 + 1 ) ( 1 + 1 ) ( 6 + 1 ) ( 3 + 1 ) ( 2 + 1 ) ( 1 + 1 ) ( 1 + 1 ) = 1 2 1