n = 1 ∑ ∞ n 2 d ( 2 0 4 8 n ) = C A π B
Where d ( n ) counts the number of divisors of n . Find A + B + C
Hint: 2048 is 2 to the power of 11. 2 is a prime.
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.
When it comes to evaluating for when k = p a , where p is a prime, a problem arises, since
F ( n ) = { 0 if n is a multiple of p a 1 otherwise
Isn't completely multiplicative, so we can't use the same method as what we did in part 1.
However, we can split the sum up and then sum them all together.
n = 1 ∑ ∞ ( p a n ) s d ( p a n ) = n = 1 ∑ ∞ ( p n ) s d ( p n ) − m = 1 ∑ a − 1 n coprime to p ∑ ( p m n ) s d ( p m n )
Since d ( n ) is multiplicative, in other words, if a and b are coprime integers, d ( a ) × d ( b ) = d ( a b )
m = 1 ∑ a − 1 n coprime to p ∑ ( p m n ) s d ( p m n ) = m = 1 ∑ a − 1 p m s d ( p m ) n coprime to p ∑ n s d ( n ) = m = 1 ∑ a − 1 p m s m + 1 n coprime to p ∑ n s d ( n )
Since through part 1,
n = 1 ∑ ∞ ( p n ) s d ( p n ) = n = 1 ∑ ∞ n s d ( n ) − n coprime to p ∑ n s d ( n ) = ζ ( s ) 2 − ( 1 − p s 1 ) 2 ζ ( s ) 2 = ζ ( s ) 2 ( 1 − ( 1 − p s 1 ) 2 )
And that
m = 1 ∑ a − 1 p m s m + 1 = p a s ( p s − 1 ) 2 2 p s ( a + 1 ) − p a s − a p 2 s + a p s − p 2 s
Putting it all together,
n = 1 ∑ ∞ ( p a n ) s d ( p a n ) = n = 1 ∑ ∞ ( p n ) s d ( p n ) − m = 1 ∑ a − 1 n coprime to p ∑ ( p m n ) s d ( p m n )
= ζ ( s ) 2 ( 1 − ( 1 − p s 1 ) 2 ) − p a s ( p s − 1 ) 2 2 p s ( a + 1 ) − p a s − a p 2 s + a p s − p 2 s ( 1 − p s 1 ) 2 ζ ( s ) 2
Hence
n = 1 ∑ ∞ n s d ( p a n ) = p s a ( ζ ( s ) 2 ( 1 − ( 1 − p s 1 ) 2 ) − p a s ( p s − 1 ) 2 2 p s ( a + 1 ) − p a s − a p 2 s + a p s − p 2 s ( 1 − p s 1 ) 2 ζ ( s ) 2 )
Simplifying gives
ζ ( s ) 2 ( a + 1 − a p − s )
Substituting p=2, s=2, a=11, gives
n = 1 ∑ ∞ n 2 d ( 2 0 4 8 n ) = ( 6 π 2 ) 2 ( 1 2 − 1 1 ⋅ 2 − 2 ) = 1 4 4 3 7 π 4
Due to how well the final equation collapsed, I'm pretty sure there is a much better solution out there.
Check out Mark Henning's answer for a more natural approach to account for the constant 2048.
Problem Loading...
Note Loading...
Set Loading...
In the first of this series, I showed that n ≥ 1 ∑ n 2 d ( N n ) = 3 6 1 π 4 j = 1 ∏ m ( a j + 1 − a j p j − 2 ) where N = p 1 a 1 p 2 a 2 ⋯ p m a m is the prime factorization of N . With N = 2 0 4 8 = 2 1 1 , the sum is equal to 3 6 1 π 4 ( 1 2 − 4 1 1 ) = 1 4 4 3 7 π 4 , making the answer 1 8 5 .