Double it or triple it? Doesn't matter

Let M M be a positive integer such that both 2 M 2M and 3 M 3M have exactly 12 positive divisors each.

Which of the following cannot be the total number of positive divisors of M ? M?

6 7 8 9

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.

1 solution

Andy Hayes
Nov 10, 2017

2 M 2M and 3 M 3M have the same number of divisors. Then in the prime factorization of M , M, 2 2 and 3 3 must have the same exponent.

Case 1 : M = 2 0 × 3 0 × m , M=2^0 \times 3^0 \times m, where m m has 6 positive divisors. Then M M has 6 positive divisors.

Case 2 : M = 2 1 × 3 1 × m , M=2^1 \times 3^1 \times m, where m m has 2 positive divisors. Then M M has 8 positive divisors.

Case 3 : M = 2 2 × 3 2 . M=2^2 \times 3^2. Then M M has 9 positive divisors.

The exponents on 2 2 and 3 3 cannot get any lower or higher, so these are the only possibilities. Therefore 7 positive divisors is impossible.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...