Let denote the set for all positive integers such that there exists a positive integer for which exactly of the positive integers less than or equal to are coprime to itself.
For example, 4 is in the set because exactly of the positive integers in are coprime to 4 itself.
Find .
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 = p 1 a 1 p 2 a 2 ⋯ p n a n where the p i are distinct primes and the a i are positive integers. Suppose 1 / N of the positive integers ≤ M are coprime to M . If N = 1 then M = 1 . Now assume M ≥ 2 , so N ≥ 2 .
Then the fraction of integers less than or equal to M which are coprime to M is p 1 p 2 ⋯ p n ( p 1 − 1 ) ( p 2 − 1 ) ⋯ ( p n − 1 ) . If this is the reciprocal of N , the power of 2 in the numerator has to be less than or equal to the power of 2 in the denominator. If all the p i are odd, this is impossible (unless M = 1 ). So without loss of generality p 1 = 2 and the denominator contains exactly one 2 . In this case, the numerator contains at most one even number, hence there is at most one other prime p 2 .
So we get 2 p 2 p 2 − 1 = N 1 , whence p 2 = N − 2 N = 1 + N − 2 2 , which is only an integer if ( N − 2 ) ∣ 2 . If N = 3 we get p 2 = 3 and if N = 4 we get p 2 = 2 , which is impossible. So p 2 = 3 is the only possibility.
Hence S = { 1 } ∪ { 2 a 3 b : a ≥ 1 , b ≥ 0 } .
Then 1 0 0 s ∈ S ∑ s 1 = 1 0 0 + 1 0 0 a = 1 ∑ ∞ b = 0 ∑ ∞ 2 a 3 b 1 = 1 0 0 + 1 0 0 a = 1 ∑ ∞ 2 a 1 b = 0 ∑ ∞ 3 b 1 = 1 0 0 + 1 0 0 ⋅ 1 ⋅ 3 / 2 = 2 5 0 .