This problem’s question is: How much larger is the denominator?
Warning: Wolfram/Alpha can not handle this problem. Wolfram Mathematica can. The indefinite integral is several pages long. Try this problem only if you have a capable CAS available.
I : n → ∫ − ∞ ∞ ( ∏ m = 1 n sinc ( 2 m − 1 x ) ) d x
The expression above is a function expressed as a mapping.
To form the answer: compute I(8), divide the result by π , take the absolute value, subtract the numerator from the denominator of the resultant rational number.
∣ ∣ ∣ π I ( m ) ∣ ∣ ∣ for m from 1 to 7 by 1 are all 1.
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.
Bravo! Good job!
Wolfram/Alpha could not handle the original integration when I tried it. It may have been a time out issue.
I : n → ∫ − ∞ ∞ ( ∏ m = 1 n sinc ( 2 m − 1 x ) ) d x
See Illusive patterns in math explained by ideas in physics .
Image credit: Majumdar and Trizac. ©2019 American Physical Society
I ( 8 ) ⇒ 4 6 7 8 0 7 9 2 4 7 2 0 3 2 0 4 5 3 6 5 5 2 6 0 8 7 5 0 0 0 4 6 7 8 0 7 9 2 4 7 1 3 4 4 0 7 3 8 6 9 6 5 3 7 8 6 4 4 6 9 π
f = I ( 8 ) and Denominator [ f ] − Numerator [ f ] ⇒ 6 8 7 9 7 1 4 9 5 8 7 2 3 0 1 0 5 3 1
The error happened as a result of choosing an incorrect copying method for the answer text . The first method seems to round to 16 decimal places and second copies as a text string without rounding. I took advantage of this situation to correct a significant, but not problem affecting, error in the last line of the problem statement.
It would be easy to adjust my proof to derive a proof for this Theorem
If you like to do so, then, please, do so. Others then might learn from reading your proof.
As I suggested, this is a slight variation on my previous calculation.
Suppose that a j > 0 for all 1 ≤ j ≤ n . If we define g n ( x ) = 2 a n 1 χ [ − a n , a n ] ( x ) , then we have ∫ − ∞ ∞ g n ( x ) d x = 1 ( F g n ) ( y ) = 2 π 1 s i n c ( a n y ) and hence j = 2 ∏ n s i n c ( a j y ) = 2 π [ F ( g 2 ⋆ g 3 ⋆ ⋯ ⋆ g n ) ] ( y ) so that 2 π 1 ∫ − ∞ ∞ j = 1 ∏ n s i n c ( a j y ) d y = ⟨ F g 1 , F ( g 2 ⋆ ⋯ ⋆ g n ) ⟩ = ⟨ g 1 , g 2 ⋆ ⋯ g n ⟩ = 2 a n 1 ∫ − a n a n ( g 2 ⋆ ⋯ g n ) ( x ) d x It is again easy to show by induction that ( g 2 ⋆ ⋯ ⋆ g n ) ( x ) = 0 whenever ∣ x ∣ > ∑ j = 1 n a j , and so it follows that 2 π 1 ∫ − ∞ ∞ j = 1 ∏ n s i n c ( a j y ) d y = 2 a n 1 ∫ − ∞ ∞ ( g 2 ⋆ ⋯ ⋆ g n ) ( x ) d x = 2 a n 1 provided that j = 2 ∑ n a j < a 1
Problem Loading...
Note Loading...
Set Loading...
it has been a few years since I posted this proof as a solution to a previous question, so it seems worth digging it out again.
These are what are called the Borwein integrals. For any k > 0 define the function f k ( x ) = 2 k χ [ − k − 1 , k − 1 ] ( x ) noting that ∫ R f k ( x ) d x = 1 ( F f k ) ( y ) = 2 π 1 s i n c ( k y ) for any k > 0 , where F denotes the Fourier transform, and s i n c ( x ) = x sin x Thus j = 1 ∏ n s i n c ( 2 j + 1 y ) = ( 2 π ) 2 1 n j = 1 ∏ n ( F f 2 j + 1 ) ( y ) = 2 π [ F ( f 3 ⋆ f 5 ⋆ ⋯ ⋆ f 2 n + 1 ) ] ( y ) where ⋆ denotes the convolution operation ( f ⋆ g ) ( x ) = ∫ R f ( y ) g ( x − y ) d y for suitable functions f , g . Note that all functions we shall be dealing with are "suitable". Thus B n = ∫ 0 ∞ j = 0 ∏ n s i n c ( 2 j + 1 x ) d x = 2 1 × 2 π ⟨ F f 1 , F ( f 3 ⋆ f 5 ⋆ ⋯ f 2 n + 1 ) ⟩ = π ⟨ f 1 , f 3 ⋆ f 5 ⋆ ⋯ ⋆ f 2 n + 1 ⟩ = 2 1 π ∫ − 1 1 ( f 3 ⋆ f 5 ⋆ ⋯ ⋆ f 2 n + 1 ) ( x ) d x Now define c n = j = 1 ∑ n 2 j + 1 1 and let F n ( x ) = ( f 3 ⋆ f 5 ⋆ ⋯ ⋆ f 2 n + 1 ) ( x ) It is a simple matter of induction to note that:
Thus, if n is small enough that c n < 1 , then B n = 2 1 π ∫ − 1 1 F n ( x ) d x = 2 1 π ∫ R F n ( x ) d x = 2 1 π j = 1 ∏ n ∫ R f 2 j + 1 ( x ) d x = 2 1 π On the other hand, if n is such that c n − 1 < 1 < c n , then B n = 2 1 π − π ∫ 1 ∞ F n ( x ) d x = 2 1 π − π ∫ 1 c n 2 n ( n − 1 ) ! ( 2 n + 1 ) ! ! ( c n − x ) n − 1 d x = 2 1 π − π 2 n n ! ( 2 n + 1 ) ! ! ( c n − 1 ) n Since c 6 < 1 < c 7 , we have B n = 2 1 π for 1 ≤ n ≤ 6 , while B 7 = 2 1 π − π 2 7 7 ! 1 5 ! ! ( c 7 − 1 ) 7 and by symmetry I ( 8 ) = 2 B 7 , so that π I ( 8 ) = 1 − 2 6 7 ! 1 5 ! ! ( c 7 − 1 ) 7 = 4 6 7 8 0 7 9 2 4 7 2 0 3 2 0 4 5 3 6 5 5 2 6 0 8 7 5 0 0 0 4 6 7 8 0 7 9 2 4 7 1 3 4 4 0 7 3 8 6 9 6 5 3 7 8 6 4 4 6 9 and the difference between the numerator and the denominator is 6 8 7 9 7 1 4 9 5 8 7 2 3 0 1 0 5 3 1 .
Of course, if you give Wolfram Alpha the above formula for B 7 , it can handle it!