The abundance of an integer is defined to be , where is the divisor sum function . What is the average abundance of the squares? That is to say, what is
If the answer is of the form with integers. Find
bonus : generalize for th powers and then find the limit as
Solve the easier version of this: part 1
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.
Lemma:
Let G ( s ) = n = 1 ∑ ∞ n s F ( n ) and F = 1 ⋆ f , where ⋆ is the Dirichlet Convolution . Then N → ∞ lim N 1 n ≤ N ∑ F ( n ) = s → 1 lim ζ ( s ) G ( s )
Proof: N → ∞ lim N 1 n ≤ N ∑ F ( n ) = N → ∞ lim N 1 d ≤ N ∑ f ( d ) d ∣ n , n ≤ N ∑ 1 = N → ∞ lim N 1 d ≤ N ∑ f ( d ) ⌊ d N ⌋ = N → ∞ lim d ≤ N ∑ d f ( d ) = s → 1 lim ζ ( s ) G ( s )
Now, using n = 0 ∑ ∞ n s F ( n ) = p ∏ a = 0 ∑ ∞ p a s F ( p a ) , if F is a multiplicative function,
n = 0 ∑ ∞ n s σ ( n k ) = p ∏ a = 0 ∑ ∞ 1 − p 1 − p a k + 1 = p ∏ ( p − 1 ) ( p s − 1 ) ( p s − p k ) p s ( p k + p s + 1 − p s − p )
Now let F ( n ) = n k σ ( n k ) , then G ( s ) = n = 1 ∑ ∞ n s + k σ ( n k ) = p ∏ ( p − 1 ) ( p k + s − 1 ) ( p k + s − p k ) p k + s ( p k + p k + s + 1 − p k + s − p ) = p ∏ ( 1 − p 1 ) ( 1 − p s + k 1 ) ( 1 − p s 1 ) ( p s + 1 1 − p s + k 1 − p 1 + 1 )
Via the lemma, N → ∞ lim N 1 n ≤ N ∑ F ( n ) = s → 1 lim p ∏ ( 1 − p 1 ) ( 1 − p s + k 1 ) ( p s + 1 1 − p s + k 1 − p 1 + 1 )
For k = 2 , this can be expressed as
N → ∞ lim N 1 n ≤ N ∑ F ( n ) = p ∏ ( 1 − p 1 ) ( 1 − p 3 1 ) ( 1 − p 1 + p 2 1 − p 3 1 ) = ( 1 − p 2 1 ) ( 1 − p 3 1 ) ( 1 − p 4 1 ) = ζ ( 4 ) ζ ( 2 ) ζ ( 3 )
Similarly, for k → ∞ , N → ∞ lim N 1 n ≤ N ∑ F ( n ) = ζ ( 6 ) ζ ( 2 ) ζ ( 3 ) .
As an exercise, try to prove that for all integer 3 ≤ k , N → ∞ lim N 1 n ≤ N ∑ F ( n ) cannot be expressed as a product of ζ ( i ) j where i ≥ 2 and j are integers.