Wolfram has the answer 2

Calculus Level 5

0 π x 2 [ ln ( 2 cos ( x 2 ) ) ] 2 d x = A B π C \large \int_0^\pi x^2 \left[ \ln \left( 2\cos \left( \dfrac x2\right) \right) \right]^2 \, dx = \dfrac AB \pi^C

The equation above holds true for positive integers A , B A,B and C C with A , B A,B coprime. Find A + B + C A+B+C .


This problem was taken from wolfram mathwold.


The answer is 196.

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 solution

Mark Hennings
Mar 31, 2016

The integral is I = 0 π x 2 [ ln 2 cos 1 2 x ] 2 d x = 8 0 1 2 π u 2 [ ln ( 2 cos u ) ] 2 d u = 8 4 F ν 2 a 2 ( 1 , 0 ) \begin{array}{rcl} \displaystyle I \; = \; \int_0^\pi x^2 \big[ \ln 2 \cos\tfrac12x\big]^2\,dx & = & \displaystyle 8\int_0^{\frac12\pi} u^2\big[ \ln(2 \cos u)\big]^2\,du \\ & = & \displaystyle -8\frac{\partial^4 F}{\partial \nu^2 \partial a^2}(1,0) \end{array} where F ( ν , a ) = 2 ν 1 0 1 2 π cos ν 1 u cos a u d u = π 2 ν B ( ν + a + 1 2 , ν a + 1 2 ) = π Γ ( ν ) 2 Γ ( ν + a + 1 2 ) Γ ( ν a + 1 2 ) . F(\nu,a) \; = \; 2^{\nu-1}\int_0^{\frac12\pi} \cos^{\nu-1}u \cos au\,du \; = \; \frac{\pi}{2 \nu B\big(\tfrac{\nu+a+1}{2},\tfrac{\nu-a+1}{2}\big)} \; = \; \frac{\pi \Gamma(\nu)}{2 \Gamma\big(\tfrac{\nu+a+1}{2}\big) \Gamma\big(\tfrac{\nu-a+1}{2}\big)} \;. Now G ( ν ) = 2 F a 2 ( ν , 0 ) = π Γ ( ν ) 4 Γ ( ν + 1 2 ) 2 ψ ( ν + 1 2 ) G(\nu) \; = \; -\frac{\partial^2 F}{\partial a^2}(\nu,0) \; = \; \frac{\pi \Gamma(\nu)}{4 \Gamma\big(\tfrac{\nu+1}{2}\big)^2} \psi'\big(\tfrac{\nu+1}{2}\big) and so G ( 1 ) G''(1) can be expressed in terms of polygamma functions, and then simplified, obtaining I = 8 G ( 1 ) = 11 180 π 5 I \; = \; 8G''(1) \; = \; \tfrac{11}{180}\pi^5 making the answer 11 + 180 + 5 = 196 11 + 180 + 5 = \boxed{196} .

Yes even I did the same way. Taking the function F(v,a) has been useful many times. Thanks because of you I've been solving many problems with the same method.

Aditya Kumar - 5 years, 2 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...