Let be the smallest positive integer such that
is a perfect square;
is a perfect cube;
is a perfect power, that is, there is another integer such that .
Find the number of positive divisors (including 1 and itself) 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.
First, we must work out what N is.
For N to be as small as possible, its only prime factors have to be 2 , 3 , and 5 .
Let N = 2 a 3 b 5 c , where a , b , and c are non-negative integers.
We want to make a , b , and c individually as small as possible.
For all conditions to be met:
l c m ( 3 , 5 ) ∣ a , and a ≡ 1 ( m o d 2 ) .
l c m ( 2 , 5 ) ∣ b , and b ≡ 1 ( m o d 3 ) .
l c m ( 2 , 3 ) ∣ c , and c ≡ 1 ( m o d 5 ) .
l c m ( 3 , 5 ) = 1 5 , l c m ( 2 , 5 ) = 1 0 , and l c m ( 2 , 3 ) = 6 .
The smallest non-negative integers fulfilling these requirements are
a = 1 5 .
b = 1 0 .
c = 6 .
Therefore N = 2 1 5 3 1 0 5 6 , and N has ( 1 5 + 1 ) ( 1 0 + 1 ) ( 6 + 1 ) = 1 6 ∗ 1 1 ∗ 7 = 1 2 3 2 positive divisors (including 1 and itself).