2 1 C 1 + 5 . 2 1 C 5 + 9 . 2 1 C 9 + . . . + 1 7 . 2 1 C 1 7 + 2 1 . 2 1 C 2 1 = k . Then find the product of all prime factors of k .
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.
It is given that: k = 0 ∑ 5 ( 4 k + 1 ) 2 1 C 4 k + 1 = k
k = 0 ∑ 5 ( 4 k + 1 ) 2 1 C 4 k + 1 = k = 0 ∑ 5 ( 4 k + 1 ) ! ( 2 0 − 4 k ) ! ( 4 k + 1 ) 2 1 ! = k = 0 ∑ 5 4 k ! ( 2 0 − 4 k ) ! 2 1 ( 2 0 ! )
= 2 1 k = 0 ∑ 5 2 0 C 4 k = 2 1 ( 2 0 C 0 + 2 0 C 4 + 2 0 C 8 + 2 0 C 1 2 + 2 0 C 1 6 + 2 0 C 2 0
Problem Loading...
Note Loading...
Set Loading...
By Binomial expansion,
( 1 + x ) 2 1 = 2 1 C 0 x 0 + 2 1 C 1 x + 2 1 C 2 x 2 + . . . + 2 1 C 2 0 x 2 0 + 2 1 C 2 1 x 2 1
Now differentiate both sides w.r.t x , then
2 1 ( 1 + x ) 2 0 = 2 1 C 1 + 2 . 2 1 C 2 x + . . . + 2 0 . 2 1 C 2 0 x 1 9 + 2 1 . 2 1 C 2 1 x 2 0
Putting x = + 1 , − 1 , i , − i (where i is − 1 ) separately to form four equations and adding them we would get.
2 1 × ( 2 2 0 + 0 + ( 1 + i ) 2 0 + ( 1 − i ) 2 0 ) = 2 1 C 1 + 5 . 2 1 C 5 + 9 . 2 1 C 9 + . . . + 1 7 . 2 1 C 1 7 + 2 1 . 2 1 C 2 1 = k
⟹ k = 2 1 × ( 2 2 0 − 2 1 1 )
⟹ k = 2 1 1 × 3 × 7 2 × 7 3
Hence the required answer is 2 × 3 × 7 × 7 3 = 3 0 6 6 .