n = 1 ∑ ∞ n 2 d ( 2 0 1 6 n ) = C A π B
Where d ( n ) counts the number of divisors of n . Find A + B + C
Hint: Prime factorise 2016
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.
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 1 6 = 2 5 × 3 2 × 7 , the sum is equal to 3 6 1 π 4 ( 6 − 4 5 ) ( 3 − 9 2 ) ( 2 − 4 9 1 ) = 6 3 5 0 4 4 6 0 7 5 π 4 , making the answer 1 0 9 5 8 3 .
Problem Loading...
Note Loading...
Set Loading...
Here is another proof of the Mark's result
( a , b ) denotes gcd ( a , b )
Say F ( k ) = n = 1 ∑ ∞ n 2 d ( k n )
F ( k ) = m = 1 ∑ ∞ n : m ∣ ( k n ) ∑ n 2 1
= m = 1 ∑ ∞ ( m , k ) m ∣ n ∑ n 2 1
= 6 π 2 m = 1 ∑ ∞ m 2 ( m , k ) 2
= 6 π 2 g ∣ k ∑ m : ( m , k ) = g ∑ m 2 g 2
= 6 π 2 g ∣ k ∑ z : ( z , g k ) = 1 ∑ g 2 z 2 g 2
Now, using inclusion-exclusion,
( m , n ) = 1 ∑ n 2 1 = 6 π 2 l ∣ m ∑ l 2 μ ( l )
So, F ( k ) = 3 6 π 4 g ∣ k ∑ l ∣ g k ∑ g 2 μ ( g )
⟹ F ( k ) = 3 6 π 4 g ∣ k ∑ g 2 μ ( g ) d ( g k )
Let k = i = 1 ∏ m p i a i
Then expanding the sum, we have:
F ( k ) = 3 6 π 4 ( ( a 1 + 1 ) ( a 2 + 1 ) … ( a m + 1 ) ) ( 1 − i = 1 ∑ m ( a i + 1 ) p i 2 a i + 1 < = i < j < = m ∑ ( a i + 1 ) p i 2 a i ( a j + 1 ) p j 2 a j … )
= 3 6 π 4 i = 1 ∏ m ( a i + 1 − a i p i − 2 )