E = 2 1 ( 1 3 0 ) + 4 1 ( 3 3 0 ) + 6 1 ( 5 3 0 ) + ⋯ + 3 0 1 ( 2 9 3 0 ) = c 2 a − b
If a , b , c are coprime integers, then which of the following is a possible value of a + b + c .
Where ( b a ) = b ! ⋅ ( a − b ) ! a !
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.
This is a very clear solution! Well done!
Wait a second, for completeness, you should prove that 63,64,65 and 66 cannot be the answer...
Do you know how to do that?
Log in to reply
Sir , what do you mean by proving the other options wrong?
Log in to reply
The author have shown that a possible value of a+b+c is 62, how does he know that there isn't any other triplets (a,b,c) whose sum is 63,64,65 or 66?
Log in to reply
@Pi Han Goh – The answer came out to be 3 1 2 3 0 − 1 , so clearly the answer is 6 2 , so where is the issue? I mean how we achieve the other values?
Log in to reply
@Ankit Kumar Jain – Another triplets of (a,b,c) that satisfy this condition is ( a , b , c ) = ( 2 5 , − 1 0 8 2 4 0 1 , 1 ) , so a possible value of a + b + c is 2 5 − 1 0 8 2 4 0 1 + 1 = − 1 0 8 2 3 7 5 .
Log in to reply
@Pi Han Goh – I now get your point. Thanks!
Let me try if I can prove it.
Log in to reply
@Ankit Kumar Jain – Yup no problem.
Hint: To prove this, just focus on the number "a".
First we write the series in sigma notation:
E = n = 1 ∑ 1 5 2 n 1 ( 2 n − 1 3 0 )
The approach here is to try and simplify the summand as far as possible:
= n = 1 ∑ 1 5 2 n 1 ( 3 1 − 2 n ) ! ( 2 n − 1 ) ! 3 0 !
= 3 1 1 n = 1 ∑ 1 5 ( 2 n ) ! ( 3 1 − 2 n ) ! 3 1 ⋅ 3 0 !
= 3 1 1 n = 1 ∑ 1 5 ( 2 n 3 1 )
From the Binomial Theorem:
( x + y ) n = k = 0 ∑ n ( k n ) x k y n − k
We take look at when x = y = 1 and x = 1 and y = − 1 , and n = 3 1 :
2 3 1 = k = 0 ∑ 3 1 ( k 3 1 ) ( 1 ) k ( 1 ) 3 1 − k _ _ _ _ _ (1)
0 = k = 0 ∑ 3 1 ( k 3 1 ) ( 1 ) k ( − 1 ) 3 1 − k _ _ _ _ _ (2)
Then we subtract the two equations 1 and 2, to get:
2 3 1 = k = 0 ∑ 3 1 ( k 3 1 ) ( 1 − ( − 1 ) 3 1 − k )
2 3 1 = k = 0 ∑ 3 1 ( k 3 1 ) ( 1 + ( − 1 ) − k )
Now we collect the non-zero terms and re-write this in sigma notation to get:
2 3 1 = 2 + 2 k = 1 ∑ 1 5 ( 2 k 3 1 )
∴ k = 1 ∑ 1 5 ( 2 k 3 1 ) = 2 3 0 − 1
We substitute this back in E to get:
E = 3 1 1 ( 2 3 0 − 1 ) = 3 1 2 3 0 − 1
∴ a + b + c = 3 0 + 1 + 3 1 = 6 2
Problem Loading...
Note Loading...
Set Loading...
We know that ( 1 + x ) n = 1 + ( 1 n ) x + ( 2 n ) x 2 + ⋯ + x n Integrating both the sides w.r.t x we get n + 1 ( 1 + x ) n + 1 + C = x + 2 1 ( 1 n ) x 2 + 3 1 ( 2 n ) x 3 + ⋯ + n + 1 1 x n + 1 Substituting x = 0 in the above expression we get C = − n + 1 1 .
n + 1 ( 1 + x ) n + 1 − n + 1 1 = x + 2 1 ( 1 n ) x 2 + 3 1 ( 2 n ) x 3 + ⋯ + n + 1 1 x n + 1
Now substituting x = 1 and x = − 1 and adding the equations gives us
n + 1 2 n + 1 − 2 n + 1 2 n − 1 = 2 ( 2 1 ( 1 n ) + 3 1 ( 2 n ) + ⋯ + n + 1 1 ) = 2 1 ( 1 n ) + 3 1 ( 2 n ) + ⋯ + n + 1 1
Now substituting n = 3 0 we get E = 3 1 2 3 0 − 1
Thus a + b + c = 6 2 .