Let be a set of (distinct!) prime numbers, and let be the geometric mean of :
Suppose there exist a prime number and a positive integer such that . What is the greatest possible number of elements in ?
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.
Let m = # S be the count of prime numbers in S , and N = ∏ S their product. Then we have N n / m = p ∴ N n = p m . Unique prime factorization guarantees that N is a power of the prime number p . However, since N is the product of distinct prime numbers, we must have N = p . This means that S = { p } has only one element.