Let be a positive integer such that both and have exactly 12 positive divisors each.
Which of the following cannot be the total number of positive divisors of
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.
2 M and 3 M have the same number of divisors. Then in the prime factorization of M , 2 and 3 must have the same exponent.
Case 1 : M = 2 0 × 3 0 × m , where m has 6 positive divisors. Then M has 6 positive divisors.
Case 2 : M = 2 1 × 3 1 × m , where m has 2 positive divisors. Then M has 8 positive divisors.
Case 3 : M = 2 2 × 3 2 . Then M has 9 positive divisors.
The exponents on 2 and 3 cannot get any lower or higher, so these are the only possibilities. Therefore 7 positive divisors is impossible.