n = 1 ∑ ∞ n 2 0 . 5 Ω ( n ) k = 1 ∑ ∞ k 2 μ ( k ) 0 . 5 Ω ( k )
μ ( n ) is the mobius function and Ω ( n ) outputs the number of prime divisors of n counted with multiplicity.
Bonus: Find a closed form for the sum, (which I am unable to do)
n = 1 ∑ ∞ n 2 2 Ω ( n )
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.
Great explanation. Recognizing how Dirichlet functions interact is important to understanding their theory.
@Julian Poon , you told us that the prime product was yet to be found!!
Log in to reply
I said that the prime product was already known as the Feller Tornier constant, but I can't find a closed form for it.
Log in to reply
@Julian Poon Where did you say that the product is known as the Feller-Tornier constant? I must have missed that ;)
Log in to reply
@Otto Bretscher – A solution was deleted and it is in the comments section I said that.
Problem Loading...
Note Loading...
Set Loading...
The product of these two Dirichlet series is the Dirichlet series of the convolution of the numerators. If we let f ( n ) = 0 . 5 Ω ( n ) , a totally multiplicative function, then f ∗ ( f μ ) = f ( 1 ∗ μ ) = f ϵ where ϵ ( 1 ) = 1 and ϵ ( n ) = 0 for n > 1 . Thus the product we seek is ∑ n = 1 ∞ n 2 f ( n ) ϵ ( n ) = 1 .
Bonus: ∑ n = 1 ∞ n 2 2 Ω ( n ) = ∏ p 1 − p 2 2 1 = 2 C − 1 1 where C is the Feller Tornier constant .