n = 1 ∑ ∞ n 2 λ ( n ) τ ( n ) = b π a a + b = ? notations:
λ ( n ) denotes the Liouville function
τ ( n ) is the divisor count function.
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.
Consider a completely multiplicative function, f(n), then ( f ∗ f ) ( n ) = d ∣ n ∑ f ( d ) f ( n / d ) = d ∣ n ∑ f ( n ) = f ( n ) τ ( n ) in this case, λ ( n ) is a multiplicative function. We put this in dirichlet series to get ( n = 1 ∑ n 2 λ ( n ) ) 2 = n = 1 ∑ ∞ n 2 λ ( n ) τ ( n ) We know the dirichlet series for n = 1 ∑ n s λ ( n ) = ζ ( s ) ζ ( 2 s ) So we have n = 1 ∑ ∞ n 2 λ ( n ) τ ( n ) = ζ 2 ( 2 ) ζ 2 ( 4 ) = 2 2 5 π 4
Wow, that is clever, f τ = f ∗ f ... I did not see that coming! (+1)
Alright... this is getting a little overkill :P
Problem Loading...
Note Loading...
Set Loading...
Since k = 0 ∑ ∞ ( − 1 ) k ( k + 1 ) x k = ( 1 + x ) − 2 ∣ x ∣ < 1 we have n = 1 ∑ ∞ n 2 λ ( n ) τ ( n ) = p ∏ ( 1 + p 2 1 ) − 2 = ( π 2 1 5 ) − 2 = 2 2 5 π 4