Binomial nested sum

Algebra Level 2

r = 0 n ( 1 ) r ( n r ) 1 \large \displaystyle \sum _{ r=0 }^{ n } { (-1 )}^{ r } { \binom{n}{r} }^{-1}

If n n is an an odd positive integer, find the value of this sum.


The answer is 0.

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.

4 solutions

Eli Ross Staff
Oct 26, 2015

Recall that ( n r ) = ( n n r ) . \binom{n}{r} = \binom{n}{n-r}. Since n n is odd, n r n-r has the opposite parity as r , r, so

( 1 ) r ( n r ) 1 = ( 1 ) n r ( n n r ) 1 . (-1)^r \binom{n}{r}^{-1} = -(-1)^{n-r}\binom{n}{n-r}^{-1}.

Thus, when we pair the terms in this way, each pair sums to 0, so the summation is 0.

is it valid to say that the summation is zero since by the definition of combination: ( n r ) = n ! r ! ( n r ) ! if 0 r n , or 0 if r > n or r < 0 , for any r, n Z with n 0. {n \choose r}={\frac{n!}{r!(n-r)!}} \text{ if } 0 \leq r \leq n, \text{ or } 0 \text{ if } r>n \text{ or } r<0,\text{ for any r, n } \in \mathbb{Z} \text{ with } n \geq 0.

We know that ( n r ) {n \choose r} is always an integer. Yet its inverse cannot be in the form 1 n , n N \frac{1}{n}, n \in \mathbb{N} . Hence, ( n r ) 1 {n \choose r}^{-1} is zero.

Is there any error with this reasoning? By the way, i got it right.. :D

Jeffer Dave Cagubcob - 5 years, 7 months ago

Log in to reply

jeffer dave cagubcob --it is hard to say that u that --

ur above explanation is wrong.

this might or is true when n-->infinite .

not when "n" is small .

hence the above problem can be solved by converting the even terms into odd once

Thus they cancel out each other.

Suraj Malthumkar - 5 years, 5 months ago

What if n is even?

Anurag Pandey - 4 years, 8 months ago

Log in to reply

Then it will be 1. This is all affected by r=0

Adolphout H - 2 months, 1 week ago
Jeffrey H.
Mar 25, 2018

If we set n n equal to 1 1 , then it is clear that the answer is 0 0 .

Affan Morshed
Oct 13, 2018

Just split the series in half, and recognize that (because of pascal's triangle's symmetry) the right hand side is the same as the left hand side except for the sense (because of the powers of -1 alternating between 1 and 1). Alternatively (I did this but almost immediately recognized the formal proof, so I knew the proper solution/proof before I answered) you could just try it for 1 (or any positive integer, but 1 is the easiest) as this question was poorly constructed. You can also get a sense that the answer would be 0, more from gut feelings and conjecture, because summations could be 0 if it cancels out all the time and the odd integer part would suggest a canceling out as it would probably be related to have an even amount of elements (so one elements always has it's additive group inverse) to cancel out to 0 (just in case you were looking for another way to start of a question like this beside looking at cases like I did).

Ervyn Manuyag
Jun 22, 2018

Anything to the power of -1 is always 0

Are you sure about that?

Clutch Noob - 2 years, 9 months ago

That is not correct, as 0.5 to the power of -1 is 2 (try it on a calculator)

Affan Morshed - 2 years, 8 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...