S = n = 1 ∑ ∞ n 4 ( − 1 ) Ω ( n )
Let Ω ( n ) denote the number of prime factors of n , counted with their multiplicities. For example, Ω ( 2 0 1 6 ) = Ω ( 2 5 × 3 2 × 7 ) = 5 + 2 + 1 = 8 .
Submit S π 4 as your answer.
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.
Yes, another crystal clear solution, clearer than many text books! (+1)
It helps that the Liouville function is completely multiplicative: For any completely multiplicative function f ( n ) the Euler product simplifies to n = 1 ∑ ∞ n s f ( n ) = p ∏ 1 − f ( p ) p − s 1
Alternatively, note that λ ( n ) = ( − 1 ) Ω ( n ) is the Liouville function, and n = 1 ∑ ∞ n s λ ( n ) = ζ ( s ) ζ ( 2 s ) which follows directly from λ ∗ 1 = 1 { 1 , 4 , 9 , 1 6 , … } .
Log in to reply
Yes, this is a very elegant solution also! (+1)
nice solution(+1). i knew this but always used dirtchlet series and never knew of this cool method!
Problem Loading...
Note Loading...
Set Loading...
Ω ( n ) is a (completely) additive function which implies ( − 1 ) Ω ( n ) is a (completely) multiplicative function.
( − 1 ) Ω ( n ) is more commonly denoted λ ( n ) and is called the Liouville function .
Since it's multiplicative we can write:
S = n = 1 ∑ ∞ n 4 λ ( n ) = p ∏ k = 0 ∑ ∞ p 4 k λ ( p k )
Since λ ( p k ) = ( − 1 ) k it becomes a geometric sum:
S = p ∏ k = 0 ∑ ∞ p 4 k ( − 1 ) k = p ∏ 1 + p 4 1 1 = p ∏ 1 − p 8 1 1 − p 4 1 = ζ ( 4 ) ζ ( 8 ) = 9 0 π 4 9 4 5 0 π 8 = 1 0 5 π 4