1
$\begingroup$

I am trying to use this definition of the binomial coefficient:

$$\binom \alpha k = \frac{\alpha^{\underline k}}{k!} = \frac{\alpha(\alpha-1)(\alpha-2)\cdots(\alpha-[k-1])}{k(k-1)(k-2)\cdots 1}$$

To check that ${-n \choose -n}=0.$ Using it for a positive $k$, I'll stop

$$a(a-1)(a-2)\dots (a-[k-1])$$

When I reach $[k-1]$ but I don't know where is this stopping point when $n$ is negative. I know that I could do the following:

$${-n \choose -n}=\frac{(-n)!}{(-n)!([-n]-[-n])}=\frac{(-n)!}{(-n)!\cdot 0}=undefined$$

But this doesn't really solve my problem. My other trial was to do this:

$$\frac{(-n)(-n-1)(-n-2)\dots(-n-[-n-1])}{(-n)(-n-1)(-n-2)\dots(-n-[-n-1])}$$

But it also doesn't seem too revealing.

$\endgroup$

1 Answer 1

1
$\begingroup$

Your definition of the binomial coefficient is incomplete: it should read

$$\binom{x}k=\begin{cases} \frac{x^{\underline k}}{k!},&\text{if }k\ge 0\\\\ 0,&\text{if }k<0\;, \end{cases}$$

where $k$ is in all cases required to be an integer. Thus, if $n$ is a positive integer we have $\binom{-n}{-n}=0$ by definition.

$\endgroup$
1
  • $\begingroup$ Yes. Thanks. I thought it would make some kind of sense to use $\binom a k = \frac{\alpha(a-1)(a-2)\cdots(a-k+1)}{k(k-1)(k-2)\cdots 1}$ alone. I am having lectures on introductory combinatorics and my professor told us that $k,x$ only make sense when non-negative integers with $k\geq x$, then I started reading Knuth/Patashnik/Graham's Concrete Mathematics and there he uses almost arbitrary $k,x$'s. I'm on an exploratory work on this new concepts. $\endgroup$
    – Red Banana
    Commented Dec 27, 2014 at 6:06

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .