Problem:
A positive integer is called primer if it has a prime number of distinct prime factors. A positive integer is called primest if it has a primer number of distinct primer factors. Find the smallest primest number.
Problem:
A positive integer is called primer if it has a prime number of distinct prime factors. A positive integer is called primest if it has a primer number of distinct primer factors. Find the smallest primest number.
Solution:
We claim the answer is , as it has primer factors: , and is a primer.
We now prove that there is no smaller primest number. Suppose there were a smaller primest number . We do casework on the number of distinct prime factors of .
- has distinct prime factors. Then , which is larger than .
- has distinct prime factors. If each of these factors has multiplicity , i.e. for distinct primes , then has precisely primer factors: , and is not a primer. Thus, contains at least one factor of multiplicity at least . If is for distinct primes , then has distinct primer factors: , and is not a primer. Thus, if , , and , which is .
- has distinct prime factors. If , for distinct primes , then 's primer factors are precisely its divisors of the form , where and , meaning that it has primer factors. Thus, is a primer, meaning that . Thus , where the other possibilities can be ruled out through easy casework.
- has distinct prime factor. Then it doesn't have any primer factors, and thus cannot possibly have a primer number of them.
We conclude that is the smallest primest number.