Notation: denotes the Möbius function .
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.
I don't have a proof that the sum converges, so maybe somebody can fill up on that. So for my solution, I will be assuming that the sum converges.
Let primes p 1 , k and p − 1 , k be primes that satisfy the following:
m o d ( p 1 , k , 4 ) = 1 m o d ( p − 1 , k , 4 ) = − 1
Where p n , 1 < p n , 2 < p n , 3 . . .
Let the set that contains all primes p n , k be S n . It is known that every prime except 2 and 3 belong to sets S 1 and S − 1 .
First thing to notice is that for a square-free number to be of the form 4 n − 3 , it has to be a product of an even number of primes from set S − 1 and any number of primes from set S 1 .
So, the sum can be re-written to be:
n = 1 ∑ ∞ 4 n − 3 μ ( 4 n − 3 ) = 1 − ∑ p 1 1 + ⎝ ⎛ k > j ∑ p 1 , k p 1 , j 1 + k > j ∑ p − 1 , k p − 1 , j 1 ⎠ ⎞ − ( a > b > c ∑ p 1 , a p 1 , b p 1 , c 1 + a > b ∑ p − 1 , a p − 1 , b 1 ∑ p 1 1 ) + ⎝ ⎛ a > b > c > d ∑ p 1 , a p 1 , b p 1 , c p 1 , d 1 + k > j ∑ p 1 , k p 1 , j 1 k > j ∑ p − 1 , k p − 1 , j 1 + a > b > c > d ∑ p − 1 , a p − 1 , b p − 1 , c p − 1 , d 1 ⎠ ⎞ . . . = 2 1 ( p 1 ∏ ( 1 − p 1 − 1 ) p − 1 ∏ ( 1 + p − 1 − 1 ) + p 1 ∏ ( 1 − p 1 − 1 ) p − 1 ∏ ( 1 − p − 1 − 1 ) ) = 2 1 ⎝ ⎛ p 1 ∏ ( 1 − p 1 − 1 ) p − 1 ∏ ( 1 + p − 1 − 1 ) + [ ( 1 − 2 1 ) ( 1 − 3 1 ) ] − 1 p is prime ∏ ( 1 − p − 1 ) ⎠ ⎞
We will first evaluate ∏ p is prime ( 1 − p − 1 ) . Through Euler Product
p is prime ∏ ( 1 − p − s ) = ζ ( s ) 1
Where ζ ( s ) is the Riemann Zeta Function. Since ζ ( 1 ) diverges
p is prime ∏ ( 1 − p − 1 ) = 0
Now we will focus on prime product
p 1 ∏ ( 1 − p 1 − 1 ) p − 1 ∏ ( 1 + p − 1 − 1 ) = p is prime ∏ ( 1 − χ ( p ) p − 1 )
Where χ ( n ) is the Dirichlet character,
χ ( n ) = ⎩ ⎪ ⎨ ⎪ ⎧ 1 if m o d ( n , 4 ) = 1 − 1 if m o d ( n , 4 ) = − 1 0 otherwise
Since χ ( n ) is completely multiplicative, through Euler Product: (This prime product is already known, and it is known to be convergent)
p is prime ∏ ( 1 − χ ( p ) p − 1 ) = [ n = 1 ∑ ∞ n χ ( n ) ] − 1
n = 1 ∑ ∞ n χ ( n ) = n = 0 ∑ ∞ 2 n + 1 ( − 1 ) n = arctan ( 1 ) = 4 π
Putting it all together,
n = 1 ∑ ∞ 4 n − 3 μ ( 4 n − 3 ) = 2 1 ( π 4 + ( 1 − 2 1 ) ( 1 − 3 1 ) ⋅ 0 ) = π 2