n = 1 ∑ ∞ ( n + 1 ) 2 4 n ζ ( 2 n ) = B A − π C K − D 1 ln F + H π I G ζ ( J )
The equation above holds true for positive integers A , B , C , D , F , G , H , I and J such that g cd ( A , B ) = g cd ( G , H ) = 1 and F is minimized.
Find A + B + C + D + F + G + H + I + J .
Notations :
ζ ( ⋅ ) denotes the Riemann zeta function .
K denotes the Catalan's constant , K = n = 0 ∑ ∞ ( 2 n + 1 ) 2 ( − 1 ) n ≈ 0 . 9 1 6
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.
(+1) The generating function can be proved by first writing ζ ( 2 n ) as the sum definition and then using the result here
Log in to reply
Indeed. Or you can look at my post there to see how to deduce the result from "first principles", using complex analysis.
Thanks. I've tidied up the question. @Hummus a , you need to be more careful with your notations.
Problem Loading...
Note Loading...
Set Loading...
There is a typo in the question - it should be 2 4 n in the denominator, not 2 4 k . If we use the formula n = 1 ∑ ∞ ζ ( 2 n ) z 2 n = 2 1 ( 1 − π z cot π z ) then the sum is 1 6 ∫ 0 4 1 x ( 1 − π x cot π x ) d x = 2 1 − π 4 C − 2 1 ln 2 + 4 π 2 3 5 ζ ( 3 ) making the answer 1 + 2 + 4 + 2 + 2 + 3 5 + 4 + 2 + 3 = 5 5 .
The question needs a bit of tidying up. Since 2 1 ln 2 = 2 k 1 ln ( 2 k ) for any positive integer k , there is more than one solution for d and f as the question is currently expressed.