n = 1 ∑ ∞ n 2 2 ω ( n )
Let ω ( n ) denote the number of distinct prime divisors of n .
If the series above can be expressed as b a , where a and b are coprime positive integers, find a + b .
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.
exact same way(+1)
range of p under the product sign ?
Use the observation that ( ∣ μ ∣ ∗ 1 ) ( n ) = 2 ω ( n ) , the respective Dirichlet series for ∣ μ ∣ and 1 ( ζ ( 2 s ) ζ ( s ) and ζ ( s ) respectively), and finally that [ m = 1 ∑ ∞ m s f ( m ) ] [ n = 1 ∑ ∞ n s g ( n ) ] = n = 1 ∑ ∞ n s ( f ∗ g ) ( n ) .
Problem Loading...
Note Loading...
Set Loading...
Firstly we notice ω ( n ) is an additive function. It's easy enough to prove so I'll leave it as an exercise.
Since it is additive it implies 2 ω ( n ) is a multiplicative function.
Let's make it general by considering:
f ( s ) = n = 1 ∑ ∞ n s 2 ω ( n ) = p ∏ [ 1 + p s 2 ω ( p ) + p 2 s 2 ω ( p 2 ) + . . . ]
Since ω ( p k ) =1 we can simplify our expression by a geometric series to:
f ( s ) = p ∏ [ 1 − p s 1 2 − 1 ] = p ∏ 1 − p s 1 1 + p s 1 = p ∏ ( 1 − p s 1 ) 2 1 − p 2 s 1 = ζ ( 2 s ) ζ ( s ) 2
So in our case for s = 2 we have f ( 2 ) = ζ ( 4 ) ζ ( 2 ) 2 = 9 0 π 4 ( 6 π 2 ) 2 = 2 5 .