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.
If S is squarefree, it means that it does not have any repeated prime factors. This means that any number that is the product of unique primes is a squarefree number.
So S is squarefree, S > 0 ∑ S n 1 = 1 + a ∑ ( p a ) n 1 + a > b ∑ ( p a p b ) n 1 + a > b > c ∑ ( p a p b p c ) n 1 . . .
Where p k is the k th prime. This is equivalent to the expansion of ∏ p is prime 1 + p − n
Hence, S is squarefree, S > 0 ∑ S 2 1 = p is prime ∏ 1 + p − 2 = ∏ p is prime 1 − p − 2 ∏ p is prime 1 − p − 4 Through Euler's product, ∏ p is prime 1 + p − n = ζ ( n ) 1 .
So the answer is ζ ( 4 ) ζ ( 2 ) = π 2 1 5
The sum converges due to ∑ S 2 1 < ζ ( 2 ) of which ζ ( 2 ) is known to converge.