Primes again 3

A = S is squarefree, S > 0 1 S 2 \large A = \sum_{S \text{ is squarefree, } \\ S>0} \frac{1}{S^{2}} Find 1000 A \lfloor1000A\rfloor .


The answer is 1519.

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

Julian Poon
Nov 16, 2015

If S 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 1 S n = 1 + a 1 ( p a ) n + a > b 1 ( p a p b ) n + a > b > c 1 ( p a p b p c ) n . . . \sum_{S \text{ is squarefree, }S>0} \frac{1}{S^{n}}=1+\sum _{ a }{ \frac { 1 }{ ({ p }_{ a })^{n} } } +\sum _{ a>b }{ \frac { 1 }{ ({ p }_{ a }{ p }_{ b } )^{n}} } +\sum _{ a>b>c }{ \frac { 1 }{ ({ p }_{ a }{ p }_{ b }{ p }_{ c })^{n} } } ...

Where p k p_{k} is the k th \text{k}^{\text{th}} prime. This is equivalent to the expansion of p is prime 1 + p n \prod _{ \text{p is prime} }{ 1+{ p }^{ -n } }

Hence, S is squarefree, S > 0 1 S 2 = p is prime 1 + p 2 = p is prime 1 p 4 p is prime 1 p 2 \sum_{S \text{ is squarefree, }S>0} \frac{1}{S^{2}}=\prod _{ \text{p is prime} }{ 1+{ p }^{ -2 } }=\frac { \prod _{\text{p is prime} }{ 1-{ p }^{ -4 } } }{ \prod _{ \text{p is prime} }{ 1-{ p }^{ -2 } } } Through Euler's product, p is prime 1 + p n = 1 ζ ( n ) \prod _{\text{p is prime} }{ 1+{ p }^{ -n } } =\frac { 1 }{ \zeta (n) } .

So the answer is ζ ( 2 ) ζ ( 4 ) = 15 π 2 \frac { \zeta (2) }{ \zeta (4) } =\frac{15}{\pi^{2}}

The sum converges due to 1 S 2 < ζ ( 2 ) \sum \frac{1}{S^{2}}<\zeta (2) of which ζ ( 2 ) \zeta{(2)} is known to converge.

Moderator note:

Note that the convergence of the summation should be placed at the start, to justify the manipulations taken.

I just used the fact that λ μ = ε \lambda * |\mu| = \varepsilon .

Jake Lai - 5 years, 6 months ago

Mobius function can be used to solve this problem easily as we need square free numbers.

Surya Prakash - 5 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...