Find the smallest number with exactly distinct positive divisors. You should include and the number as divisors.
IRL ABooklet
Solution
The divisors of an integer with prime factorisation
are all of the form , where . Hence, the number of positive divisors of is equal to and for each prime number that divides , we have .
We are looking for the smallest for which . Because , can have at most different prime divisors. We will consider, one after the other, the cases .
k = 4. The four factors must be , hence the are . To make the number as small as possible, we pair the big with the smallest primes possible. This gives
k = 3. The set of three factors must be either , or , or , or . Again, pairing the larger powers with the smaller primes, we get the following possibilities:
We can reject the last two candidates as being too big. We will return to the first two at the end.
k = 2. With two factors, we are only interested in case where the result will be less than , so both exponents, and , must be less than , otherwise result will be at least . One of the two factors of must be larger than , so we are looking for a factor of between and . From the prime factorisation of we see that there is no factor in this range.
k = 1. The smallest possibility with one factor is , which is way too big. We are left with three candidates:
and need to decide which is the smallest. We can take out a common factor of and compare and find the first is the smallest. Thus is the smallest number with exactly distinct positive divisors.