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.
We'll look first at the partial product
k = 0 ∏ N ( 1 + 2 2 k 1 ) = ( 1 + 2 1 ) ( 1 + 4 1 ) ( 1 + 1 6 1 ) . . . . ( 1 + 2 2 N 1 ) .
Now multiply this product by 1 in the form 1 − 2 1 1 − 2 1 = 2 ∗ ( 1 − 2 1 ) .
The partial product then becomes
2 ∗ ( 1 − 2 1 ) ( 1 + 2 1 ) ( 1 + 4 1 ) ( 1 + 1 6 1 ) . . . ( 1 + 2 2 N 1 ) =
2 ∗ ( 1 − 4 1 ) ( 1 + 4 1 ) ( 1 + 1 6 1 ) . . . . ( 1 + 2 2 N 1 ) =
2 ∗ ( 1 − 1 6 1 ) ( 1 + 1 6 1 ) . . . . ( 1 + 2 2 N 1 ) = 2 ∗ ( 1 − 2 5 6 1 ) . . . . ( 1 + 2 2 N 1 ) .
The "collapsing", or telescoping, of the partial product would continue until we're left with
2 ∗ ( 1 − 2 2 N 1 ) ( 1 + 2 2 N 1 ) = 2 ∗ ( 1 − 2 2 N + 1 1 ) .
As N → ∞ we have 2 2 N + 1 1 → 0 , leaving us with an infinite product of 2 .