Cubefree

n cube-free ( 2 ) 2 ω ( n ) Ω ( n ) n 2 \large \sum_{n \text{ cube-free}} \dfrac{(-2)^{2\omega(n)-\Omega(n)}}{n^2}

If the sum above can be expressed in the form of a b π m \dfrac a{b \pi^m} , where a , b a,b and m m are positive integers with a , b a,b coprime, find a + b + m a+b+m .

Clarifications :

  • n n runs through all positive integers.

  • ω ( n ) \omega(n) denotes the number of distinct prime divisors of n n .

  • Ω ( n ) \Omega(n) counts the prime divisors of n n with multiplicity.


The answer is 41.

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.

2 solutions

Otto Bretscher
Apr 13, 2016

Beautiful problem!

This is the Euler product, for all primes p p , of a = 0 2 ( 2 ) 2 ω ( p a ) Ω ( p a ) p 2 a = 1 2 p 2 + 1 p 4 = ( 1 1 p 2 ) 2 \sum_{a=0}^{2}\frac{(-2)^{2\omega(p^a)-\Omega(p^a)}}{p^{2a}}=1-\frac{2}{p^2}+\frac{1}{p^4}=\left(1-\frac{1}{p^2}\right)^2 . The product of these is ζ ( 2 ) 2 = 36 1 π 4 \zeta(2)^{-2}=\frac{36}{1\pi^4} , so that the answer is 41 \boxed{41} .

Moderator note:

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 μ μ \mu * \mu ;)

Jake Lai - 5 years, 2 months ago

Log in to reply

I thought of it as the Dirichlet inverse of the divisor function d d ... it's all the same.

Otto Bretscher - 5 years, 2 months ago

Log in to reply

In fact ( μ μ μ n ) ( p k ) = ( 1 ) k ( n k ) \displaystyle (\underbrace{\mu * \mu * \ldots * \mu}_n)(p^k) = (-1)^k\binom{n}{k} and ( μ μ μ n ) ( p k ) = ( n k ) \displaystyle (\underbrace{|\mu| * |\mu| * \ldots * |\mu|}_n)(p^k) = \binom{n}{k} .

Jake Lai - 5 years, 2 months ago

Log in to reply

@Jake Lai Interesting!

Otto Bretscher - 5 years, 2 months ago
Mark Hennings
Apr 14, 2016

The sum is equal to n 1 X ( n ) n 2 \sum_{n \ge 1} \frac{X(n)}{n^2} where X X is the multiplicative function such that X ( p n ) = { 1 n = 0 2 n = 1 1 n = 2 0 n 3 X(p^n) \; =\; \left\{ \begin{array}{lll} 1 & \qquad & n = 0 \\ -2 && n = 1 \\ 1 && n = 2 \\ 0 && n \ge 3 \end{array} \right. for any prime p p . Thus ( 1 X ) ( p n ) = μ ( n ) = { 1 n = 0 1 n = 1 0 n 2 (1 \star X)(p^n) \; = \; \mu(n) \; = \; \left\{ \begin{array}{lll} 1 &\qquad& n = 0 \\ -1 && n = 1 \\ 0 && n \ge 2 \end{array} \right. and hence X = μ μ X \,=\, \mu \star \mu . Thus n g e 1 X ( n ) n 2 = ( n g e 1 μ ( n ) n 2 ) 2 = ( ζ ( 2 ) 1 ) 2 = ζ ( 2 ) 2 = 36 π 4 \sum_{n\ ge 1} \frac{X(n)}{n^2} \; = \; \left(\sum_{n\ ge 1} \frac{\mu(n)}{n^2}\right)^2 \; = \; \big(\zeta(2)^{-1}\big)^2 \; = \; \zeta(2)^{-2} \; = \; \frac{36}{\pi^4} which makes the answer 41 \boxed{41} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...