Another mean question

Let S S be a set of (distinct!) prime numbers, and let S G \langle S\rangle_G be the geometric mean of S S :

S G = S # S . \langle S\rangle_G = \sqrt[\#S]{\prod S}.

Suppose there exist a prime number p p and a positive integer n n such that S G n = p \langle S \rangle_G^n = p . What is the greatest possible number of elements in S S ?

3 There is no maximum size for S S . 2 Such a set does not exist. 1 37

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.

1 solution

Arjen Vreugdenhil
Feb 16, 2016

Let m = # S m = \#S be the count of prime numbers in S S , and N = S N = \prod S their product. Then we have N n / m = p N n = p m . N^{n/m} = p\ \ \therefore\ \ N^n = p^m. Unique prime factorization guarantees that N N is a power of the prime number p p . However, since N N is the product of distinct prime numbers, we must have N = p N = p . This means that S = { p } S = \{p\} has only one element.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...