Questions tagged [binomial-coefficients]

For questions that explicitly reference the binomial coefficients, Pascal's Triangle, and Binomial identities.

In mathematics, the binomial coefficients are the positive integers that occur as coefficients in the binomial theorem. Commonly, a binomial coefficient is indexed by a pair of integers n ≥ k ≥ 0 and is written as $\dbinom{n}{k}$. It is the coefficient of $x^k$ term in the polynomial expansion of the binomial power $(1+x)^n$; this coefficient can be computed by the multiplicative formula:
$\dbinom{n}{k} = \frac{n(n-1)(n-2)...(n-k+1)}{k(k-1)(k-2)...1}$
which using factorial notation can be compactly expressed as
$\dbinom{n}{k} = \frac{n!}{k!(n-k)!}$
Arranging the numbers $\dbinom{n}{0}, \dbinom{n}{1}, \dbinom{n}{2},..., \dbinom{n}{k}$ gives a triangular array called Pascal's triangle, satisfying the recurrence relation :
$\dbinom{n}{k} = \dbinom{n-1}{k-1} + \dbinom{n-1}{k}$.
The binomial coefficients occur in many areas of mathematics, and especially in combinatorics.
The binomial coefficients can be generalized to $\dbinom{z}{k}$ for any complex number $z$ and integer $k ≥ 0$, and many of their properties continue to hold in this more general form.

406 questions
23
votes
1 answer

Are there good bounds on binomial coefficients?

Motivated by the central limit theorem, one expects that $$\binom{n}{k} \approx \frac{2^n}{\sqrt{\pi n/2}} \exp\left(-\frac{(k-n/2)^2}{n/2}\right).$$ Computations suggest that the ratio of the two sides approaches 1 only for $|k-n/2| < 2\sqrt{n}$,…
Kevin O'Bryant
  • 9,666
  • 6
  • 54
  • 83
9
votes
3 answers

Multiplicative Convolution for Binomial Coefficients

I know Vandermonde's convolution for binomial coefficients: $$\sum_{j=0...k} \binom{n}{j} \binom{m}{k-j} = \binom{n+m}{k}$$ Is there a similar multiplicative convolution? More precisely, is there a simple formula for the coefficients…
Hoffjan
  • 93
7
votes
4 answers

Maximum value of the binomial coefficient as a polynomial

What is the maximum (absolute) value of the binomial coefficient $\begin{pmatrix}x \\ k\end{pmatrix} = \frac{1}{k!}x(x-1)(x-2)\dotsb(x-k+1)$ for real $x$ in the interval $0 \leq x \leq k-1$?
6
votes
1 answer

Elementary proof for identity involving sums of binomials

Is there an elementary proof of this identity? $$n + 1 - \sum_{k=1}^{n} k^{k-1} \binom{n}{k} \frac{(n-k)^{n+1-k}}{n^{n}} =1 + \sum_{k=1}^n \frac{n!}{(n-k)!n^k}\;?$$ The term on the right is the average time to find a duplicate birthday from the…
Simd
  • 3,195
4
votes
3 answers

Closed form for binomial coeff sum

As part of a proof in finite group theory, I'm looking for a closed form for the expression $$\sum_{i=j+1}^{n} \binom{\binom{i}{j}}{2}$$ Any help - especially with reference or proof - would be appreciated. In the group theory context, there is…
4
votes
2 answers

Partial Sum of the Binomial Theorem

The binomial theorem states $\sum_{k=0}^nC_n^kr^k=(1+r)^n$. I am interested in the function \begin{equation} \sum_{k=0}^mC_n^kr^k, \quad m
Jian
  • 41
4
votes
0 answers

How find this binomial-coefficients sum $\sum_{k_{1}+k_{2}+\cdots+k_{d}=n}\binom{n}{k_{1},k_{2},\cdots,k_{d}}^2$

Assmue that $d$ is give postive integer numbers,and $$(x_{1}+x_{2}+\cdots+x_{d})^n=\sum_{k_{1}+\cdots+k_{d}=n} \binom{n}{k_{1},k_{2},\cdots,k_{d}}x^{k_{1}}_{1}x^{k_{2}}_{2}\cdots x^{k_{d}}_{d}$$ can see: Multinomial theorem Find the closed…
math110
  • 4,230
3
votes
3 answers

A question about summation formula involving binomial coefficient

In Table of Integrals, Series, and Products. Seventh Edition. I.S. Gradshteyn and I.M. Ryzhik, there is 0.154.3 $$ \sum_{k=0}^N (-1)^k {N \choose k} k^{n-1} =0, N \geq n \geq 1; 0^0 ≡ 1 $$ 0.154.4 $$ \sum_{k=0}^n (-1)^k {n \choose k} k^{n}…
user26143
  • 133
  • 5
3
votes
1 answer

Limit of sum of binomials

I'm trying to calculate the limit for the sum of binomial coefficients: $$S_{n}=\sum_{i=1}^n \left(\frac{{n \choose i}}{2^{in}}\sum_{j=0}^i {i \choose j}^{n+1} \right).$$ Numerically it seems to converge rapidly to zero and I have asked at…
2
votes
1 answer

Bounding a hypergeometric sum

Is there a general method for finding upper bounds of hypergeometric sums? The sum in particular I am trying to bound is $\sum_{j=1}^{k}\binom{k-1}{j-1}\binom{n-k-1}{j-1}4^{k-j}$. This is a hypergeometric sum with ratio…
bandini
  • 491
2
votes
0 answers

Terminology: Central binomial coefficients?

Is there a special terminology for the binomial coefficients $\binom{n}{\lfloor\frac{n}{2}\rfloor}$ which distinguishes them from the central binomial coefficients $\binom{2n}{n}?$
2
votes
1 answer

Upper bound of sum of binomial coefficients

I am looking for an upper bound - up to constant factor - for: $\sum_{k=t}^{t+l} {n \choose k} \cdot 2^{-n}$ where: The values of $t$ are between: $\frac{n}2+\sqrt{n} \leq t \leq \frac{9n}{10}$. (The previous $\frac9{10}$ can be replaced by any…
2
votes
2 answers

The zeros of alternating sign, binomial coefficient polynomials

I have a question regarding the zeros of the following polynomial, based on partial rows of pascal's triangle, $$f(x)=\sum_{k=a}^n\binom{n}{k}(-1)^{k}x^k,$$ where $a,n\in \mathbb{Z}^+,n>a.$ Specifically, I'm wondering if there exists zeros for $f$…
2
votes
0 answers

Resources on Wolstenholme's theorem

In Wikipedia entry on Wolstenholme's theorem, it says The second formulation $\binom{ap}{bp}=\binom{a}{b}\pmod{p^3}$ of Wolstenholme's theorem is due to J. W. L. Glaisher. But there is no reference to it. Does anyone know which paper of J. W. L.…
Z.H.
  • 5,273
2
votes
0 answers

Another identity involving sums of (alternating) binomial coefficients.

I have derived two different solutions to the same problem involving computing the expected time to find $k$ swaps when collecting coupons. However to me the two sums, although apparently numerically identical, look completely unrelated. Is there…
Simd
  • 3,195
1
2