( 1 − 2 2 1 ) ( 1 − 3 2 1 ) ( 1 − 4 2 1 ) ⋯ ( 1 − 2 0 1 6 2 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.
Notice that every fraction in the form ( 1 − k 2 1 ) can be written as ( 1 − k 1 ) ( 1 + k 1 ) . Expanding for the first few yields ( 1 − 2 1 ) ( 1 + 2 1 ) ( 1 − 3 1 ) ( 1 + 3 1 ) . . . ( 1 − 2 0 1 6 1 ) ( 1 + 2 0 1 6 1 ) = ( 2 1 ) ( 2 3 ) ( 3 2 ) ( 3 4 ) . . . ( 2 0 1 6 2 0 1 5 ) ( 2 0 1 6 2 0 1 7 ) Note that all consecutive terms starting from the second cancels out, so we are left with ( 2 1 ) ( 2 0 1 6 2 0 1 7 ) = 4 0 3 2 2 0 1 7
Problem Loading...
Note Loading...
Set Loading...
We need to find: k = 1 ∏ 2 0 1 5 ( 1 − ( k + 1 ) 2 1 ) We rewrite as follows: k = 1 ∏ 2 0 1 5 ( ( k + 1 ) 2 ( k + 1 ) 2 − 1 ) Notice that the numerator can be factored as a difference of squares: k = 1 ∏ 2 0 1 5 ( ( k + 1 ) 2 ( ( k + 1 ) + 1 ) ( ( k + 1 ) − 1 ) ) = k = 1 ∏ 2 0 1 5 ( ( k + 1 ) 2 k ( k + 2 ) ) Now we write out some terms: k = 1 ∏ 2 0 1 5 ( ( k + 1 ) 2 k ( k + 2 ) ) = ( 2 2 1 ⋅ 3 ) ⋅ ( 3 2 2 ⋅ 4 ) ⋅ . . . ⋅ ( 2 0 1 6 2 2 0 1 5 ⋅ 2 0 1 7 ) It follows that the product is: ( 2 2 1 ⋅ 3 ) ⋅ ( 3 2 2 ⋅ 4 ) ⋅ . . . ⋅ ( 2 0 1 6 2 2 0 1 5 ⋅ 2 0 1 7 ) = ( 2 ⋅ 3 ⋅ . . . ⋅ 2 0 1 6 ) 2 ( 1 ⋅ 2 ⋅ . . . ⋅ 2 0 1 5 ) ( 3 ⋅ 4 ⋅ . . . ⋅ 2 0 1 7 ) = ( 2 0 1 6 ! ) 2 ( 2 0 1 5 ! ) ( 2 2 0 1 7 ! ) We finally reduce this to: ( 2 0 1 6 ! ) 2 ( 2 0 1 5 ! ) ( 2 2 0 1 7 ! ) = 4 0 3 2 2 0 1 7 So we conclude: k = 1 ∏ 2 0 1 5 ( 1 − ( k + 1 ) 2 1 ) = 4 0 3 2 2 0 1 7