Let be a positive integer which has 30 divisors inclusive of 1 and itself, find the minimum value for .
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 number of divisors of a number n in the form n = α 1 p 1 ∗ α 2 p 2 ∗ . . . ∗ α n p n where α 1 , α 2 . . . α n are prime numbers, is given by N d = ( p 1 + 1 ) ∗ ( p 2 + 2 ) ∗ . . . ∗ ( p n + 1 ) .
The way to write 30 minimizing the value of n is 3 0 = 5 ∗ 3 ∗ 2 → n = 2 4 ∗ 3 2 ∗ 5 = 7 2 0