g cd ( n , 2 0 1 9 ) = 1 ∑ n 2 1 = c a π b
Find a + b + c , where a and c are coprime positive integers.
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.
S = n ∤ 3 , 6 7 3 ∑ n 2 1 = p is prime = 3 , 6 7 3 ∏ n = 0 ∑ ∞ p 2 n 1 = p is prime ∏ ( 1 − p − 2 ) − 1 ( 1 − 3 − 2 ) ( 1 − 6 7 3 − 2 ) = ζ ( 2 ) ( 1 − 3 − 2 ) ( 1 − 6 7 3 − 2 ) = π 2 ⋅ 4 0 7 6 3 6 1 6 0 3 9 0 4
Problem Loading...
Note Loading...
Set Loading...
2 0 1 9 have the following divisors: { 1 , 3 , 6 7 3 , 2 0 1 9 } . So, every integer n except for multiples of 3 and 6 7 3 have g cd ( n , 2 0 1 9 ) = 1 .
Thus, we have to take the sum over all integer n and then subtract n multiple of 3 or 6 7 3 , i.e., n = 3 k or n = 6 7 3 k . But by doing so we subtract two times the multiples of both 3 and 6 7 3 , i.e., the multiples of 3 ⋅ 6 7 3 = 2 0 1 9 , or n = 2 0 1 9 k . So we add them back. Then:
S = k = 1 ∑ ∞ k 2 1 − k = 1 ∑ ∞ ( 3 k ) 2 1 − k = 1 ∑ ∞ ( 6 7 3 k ) 2 1 + k = 1 ∑ ∞ ( 2 0 1 9 k ) 2 1
S = ( 1 − 3 2 1 − 6 7 3 2 1 + 2 0 1 9 2 1 ) k = 1 ∑ ∞ k 2 1
S = 1 3 5 8 7 8 7 1 2 0 7 8 0 8 ⋅ 6 π 2
S = 4 0 7 6 3 6 1 6 0 3 9 0 4 π 2
So:
a = 6 0 3 9 0 4 , b = 2 , c = 4 0 7 6 3 6 1 , a + b + c = 4 6 8 0 2 6 7