n = 0 ∏ ∞ ( 1 + 2 0 1 5 2 n 1 ) = b a
For the equation above, given that a and b are positive coprime integers, find a + b .
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.
Splendid. Is the generalization n = 0 ∏ ∞ ( 1 + A 2 n 1 ) = 1 + A − 1 1 true for all A > 1 ?
If we're considering this:
P = n = 0 ∏ ∞ ( 1 + 2 0 1 5 2 n 1 ) = n → ∞ lim i = 0 ∏ n ( 1 + 2 0 1 5 2 n 1 )
Then, I think that the following limit is more justified:
P = ( 1 − 2 0 1 5 1 ) − 1 ⋅ n → ∞ lim ( 1 − 2 0 1 5 2 n + 1 1 ) = 2 0 1 4 2 0 1 5
Although this doesn't change much.
Log in to reply
You're right. I got fast and loose with the limit at the end since I wasn't quite sure how to present it, but the answer is still the same regardless.
Log in to reply
This is off topic. Is ∫ 0 2 π sin 2 ( x ) sin 2 ( n x ) d x = 2 n π true ?
Log in to reply
@Vighnesh Raut – This beautiful identity does appear to be true. This link shows that
∫ 0 2 π sin 2 ( x ) sin 2 ( n x ) d x = 2 n π .
From here we can use a symmetry argument to conclude that the integral from 0 to 2 π is 4 1 ∗ 2 n π = 2 n π .
Log in to reply
@Brian Charlesworth – So, is it possible to prove it by induction because when I tried , it went long up to 2 pages and I reached no where.
Log in to reply
@Vighnesh Raut – There are already three answers posted in that Math SE link he gave. You should check that out. At times, a direct proof is easier and more doable than an inductive proof.
Log in to reply
@Prasun Biswas – Direct proof was indeed of great help. I don't know why I complicated things up..
@Vighnesh Raut – In the link, Christian Blatter's solution establishes a recursion, which I suppose is closely related to induction. One of the other solutions does use induction, so it can be done this way but it does seem to involve more work.
Log in to reply
@Brian Charlesworth – yep, his solution was of great help, and when I saw the graph of the function, it was clear that rule of symmetry could be applied here...Thanks for your kind help Sir.
Problem Loading...
Note Loading...
Set Loading...
Multiply the product on the left-hand side of the equation by 1 in the form
1 − 2 0 1 5 1 1 − 2 0 1 5 1 . The product will then be
2 0 1 4 2 0 1 5 ( 1 − 2 0 1 5 2 1 1 ) ( 1 + 2 0 1 5 2 1 1 ) ( 1 + 2 0 1 5 2 2 1 ) . . . . . . . =
2 0 1 4 2 0 1 5 ( 1 − 2 0 1 5 2 2 1 ) ( 1 + 2 0 1 5 2 2 1 ) ( 1 + 2 0 1 5 2 3 1 ) . . . .
As can be seen, this product "compresses" one pair at a time, since for any integer n ≥ 0 we have that
( 1 − 2 0 1 5 2 n 1 ) ( 1 + 2 0 1 5 2 n 1 ) = 1 − 2 0 1 5 2 n + 1 1 .
This "compressing" continues on ad infinitum, and thus the product goes to
2 0 1 4 2 0 1 5 lim n → ∞ ( 1 ± 2 0 1 5 2 n 1 ) = 2 0 1 4 2 0 1 5 .
Thus a + b = 2 0 1 5 + 2 0 1 4 = 4 0 2 9 .