If the equation above holds true for integer constants and , find .
Notations :
counts the number of prime factors of (with multiplicity)
counts the number of divisors of .
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.
Disclaimer: I do not have a proof that this sum converges.
Ω ( n ) is a completely additive function. That is, Ω ( a b ) = Ω ( a ) + Ω ( b ) , where a and b are positive integers.
Lemma: For a completely additive function, f ∗ 1 = 2 1 f ( n ) τ ( n )
Where ∗ is the Dirichlet convolution.
Proof:
By definition of completely additive,
f ( n ) = f ( d ) + f ( n / d )
f ∗ 1 = d ∣ n ∑ f ( n / d ) = d ∣ n ∑ ( f ( n ) − f ( d ) ) = τ ( n ) f ( n ) − d ∣ n ∑ f ( d ) ) = τ ( n ) f ( n ) − f ∗ 1
Rearranging,
f ∗ 1 = 2 1 f ( n ) τ ( n )
Since Ω is a completely additive function,
2 Ω ∗ 1 = Ω ( n ) τ ( n )
2 ζ ( 2 ) n = 1 ∑ ∞ n 2 Ω ( n ) = n = 1 ∑ ∞ n 2 Ω ( n ) τ ( n )
Also, since Ω = g ∗ 1 , where g ( n ) = { 1 if n = p a , a > 0 0 otherwise
n = 1 ∑ ∞ n 2 Ω ( n ) = ζ ( 2 ) n = 1 ∑ ∞ n 2 g ( n )
n = 1 ∑ ∞ n 2 g ( n ) = p is prime ∑ a = 1 ∑ ∞ p 2 a 1 = p is prime ∑ p 2 − 1 1
Putting it all together,
n = 1 ∑ ∞ n 2 Ω ( n ) τ ( n ) = 2 ζ ( 2 ) 2 p is prime ∑ p 2 − 1 1
Using the fact that ζ ( 2 ) = 6 π 2 ,
n = 1 ∑ ∞ n 2 Ω ( n ) τ ( n ) = 1 8 π 4 p is prime ∑ p 2 − 1 1