If the sum above can be expressed as where are positive integers, input your answer as
Notation: is the Euler's totient function and is the Riemann Zeta function .
Bonus: Generalize the sum where is a positive integer such that
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.
I've already solved it here , the solution goes as :
We have by Drichlet Convolution ( ϕ ∗ I ) ( n ) = n
I ( n ) Denotes the Identity Function .
P r o o f
( ϕ ∗ I ) ( n ) = d ∣ n ∑ ϕ ( d ) I ( d n ) = d ∣ n ∑ ϕ ( d ) = n
Of course it is a well known identity that ∑ d ∣ n ϕ ( d ) = n
Next we have :
n ∈ N ∑ n s ( f ∗ g ) ( n ) = n ∈ N ∑ n s f ( n ) n ∈ N ∑ n s g ( n )
P r o o f
We may write the summation as :
n ∈ N ∑ n s ( f ∗ g ) ( n ) = n ∈ N ∑ n = d 1 d 2 ∑ d 1 s f ( d 1 ) d 2 s f ( d 2 )
Note that every ordered pair ( d 1 , d 2 ) occurs exactly once namely n = d 1 d 2
So the above summation can be rewritten as :
n ∈ N ∑ n s ( f ∗ g ) ( n ) = d 1 ∈ N ∑ d 1 s f ( d 1 ) d 1 ∈ N ∑ d 2 s f ( d 2 )
Thus we have
n ∈ N ∑ n s ( f ∗ g ) ( n ) = n ∈ N ∑ n s f ( n ) n ∈ N ∑ n s g ( n ) .
Here : f ( n ) = ϕ ( n ) & g ( n ) = I ( n )
n ∈ N ∑ ζ ( s − 1 ) n s n ( ϕ ∗ I ) ( n ) = n ∈ N ∑ n s ϕ ( n ) n ∈ N ∑ ζ ( s ) n s 1 I ( n )
⟹ n ∈ N ∑ n s ϕ ( n ) = ζ ( s ) ζ ( s − 1 )
This gives the sum n = 1 ∑ ∞ n 3 ϕ ( n ) = ζ ( 3 ) ζ ( 2 ) = 6 ζ ( 3 ) π 2 making the answer 3 6 .