n cube-free ∑ n 2 ( − 2 ) 2 ω ( n ) − Ω ( n )
If the sum above can be expressed in the form of b π m a , where a , b and m are positive integers with a , b coprime, find a + b + m .
Clarifications :
n runs through all positive integers.
ω ( n ) denotes the number of distinct prime divisors of n .
Ω ( n ) counts the prime divisors of n with multiplicity.
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 observation breaking up the summation into a series of products which are much easier to evaluate.
Yes, and in fact, this implies that the function in question is actually μ ∗ μ ;)
Log in to reply
I thought of it as the Dirichlet inverse of the divisor function d ... it's all the same.
Log in to reply
In fact ( n μ ∗ μ ∗ … ∗ μ ) ( p k ) = ( − 1 ) k ( k n ) and ( n ∣ μ ∣ ∗ ∣ μ ∣ ∗ … ∗ ∣ μ ∣ ) ( p k ) = ( k n ) .
The sum is equal to n ≥ 1 ∑ n 2 X ( n ) where X is the multiplicative function such that X ( p n ) = ⎩ ⎪ ⎪ ⎨ ⎪ ⎪ ⎧ 1 − 2 1 0 n = 0 n = 1 n = 2 n ≥ 3 for any prime p . Thus ( 1 ⋆ X ) ( p n ) = μ ( n ) = ⎩ ⎨ ⎧ 1 − 1 0 n = 0 n = 1 n ≥ 2 and hence X = μ ⋆ μ . Thus n g e 1 ∑ n 2 X ( n ) = ( n g e 1 ∑ n 2 μ ( n ) ) 2 = ( ζ ( 2 ) − 1 ) 2 = ζ ( 2 ) − 2 = π 4 3 6 which makes the answer 4 1 .
Problem Loading...
Note Loading...
Set Loading...
Beautiful problem!
This is the Euler product, for all primes p , of ∑ a = 0 2 p 2 a ( − 2 ) 2 ω ( p a ) − Ω ( p a ) = 1 − p 2 2 + p 4 1 = ( 1 − p 2 1 ) 2 . The product of these is ζ ( 2 ) − 2 = 1 π 4 3 6 , so that the answer is 4 1 .