Skip to main content

All Questions

0 votes
0 answers
45 views

Closed form for nested sum involving ratios of binomial coefficients

I ran into the following nested sum of binomial coefficients in my research, but I couldn't find the closed form expression for it. I looked at various sources and still couldn't find the answer. So I ...
Weishun Zhong's user avatar
3 votes
1 answer
84 views

Combinatorial Proof of the $\sum_{k=1}^{n} k^2 \binom{n}{k} = n(n + 1) 2^{n - 2}$ [duplicate]

How to prove that $$\sum_{k = 1}^{n}k^2\binom{n}{k} = n(n + 1)2^{n -2}$$ in an combinatorial way? I have a algebraic proof method, but I don't know how to use a combinatorial proof method to do it.
crimsnow's user avatar
0 votes
0 answers
43 views

Evaluating Difference of Product of Binomial Coefficients

As part of my project I'm asked to evaluate the positivity of the following difference: $$\binom{l_1+t-1}{l_1}\binom{l_2+m+t-1}{l_2+m}\sum_{j=0}^{t}\binom{t-j+m}{m}\binom{j+l_1}{j}\binom{j+l_2}{j}-\...
Haimu Wang's user avatar
0 votes
1 answer
128 views

Spivak Exercise, Prove Vandermonde's Identity $\sum_{k=0}^{l}\binom{n}{k}\binom{m}{l-k}=\binom{n+m}{l}$ [duplicate]

Prove that $$\sum_{k=0}^{l}\binom{n}{k}\binom{m}{l-k}=\binom{n+m}{l}$$ Hint: Apply the binomial theorem to $(1+x)^n(1+x)^m$ Proof: Following Spivak's advice, we have $\sum_{k=0}^{n}\binom{n}{k}x^k=(...
Edward Falls's user avatar
0 votes
0 answers
44 views

Choosing an ordered triplet of non-negative integers $(m_1, m_2, m_3)$ such that $m_1 + m_2 + m_3 = n$.

Define $$A = \{ (m_1, m_2, m_3) : m_1 \geq 0, m_2 \geq 0, m_3 \geq 0, m_1 + m_2 + m_3 = n\}$$ Given that $n \geq 0$ and $n, m_1, m_2, m_3 \in \mathbb{Z}^+$, then why it is the case that $$\vert A \...
microhaus's user avatar
  • 934
0 votes
2 answers
45 views

Trying to prove equivalence of combinatorial formula and nested summations

I��m sorry if this is a dumb problem, but I’m trying to get into mathematics and prove this but I’m only in 9th grade and haven’t found any sources on this: Prove that $$ {n \choose r} = \overbrace{ \...
Joproblox Bardouha's user avatar
4 votes
3 answers
70 views

$(1-x)^{n+a} \sum_{j=0}^\infty \binom{n+j-1}{j}\binom{n+j}{a} x^j = \sum_{j=0}^a \binom{n}{a-j}\binom{a-1}{j} x^j$

Let $n$ and $a$ be natural numbers. How to prove the following for $x \in [0, 1)$? $$ (1-x)^{n+a} \sum_{j=0}^\infty \binom{n+j-1}{j}\binom{n+j}{a} x^j = \sum_{j=0}^a \binom{n}{a-j}\binom{a-1}{j} x^j $$...
ploosu2's user avatar
  • 9,748
4 votes
1 answer
140 views

What is the name of this combinatorial identity?

In the course of my physics research, I appear to have stumbled onto the following combinatorial identity: $${dn\choose m}=\sum_{\vec k} {n \choose \vec k}\,\prod_{j=0}^d {d \choose j}^{k_j},$$ where $...
David Raveh's user avatar
  • 1,835
0 votes
2 answers
73 views

Lower Bound on the ratio of binomial coefficients

Let $k,n,m$ be integers such that $k>n>m$. I am interested in providing a tight lowerbound on $$ A(k,n,m)=\frac{\binom{k-m}{n-m}}{\binom{k}{n}} $$ This term arises in a probability problem that ...
MMH's user avatar
  • 714
5 votes
2 answers
164 views

Estimate a sum of binomial coefficients

I should know this by the time, but: can someone tell me how to rigorously compute the leading order (including the constant) of the following sum: $$\sum_{ 1\leq k \leq n/3 } {2 k \choose k} {n-2k-1 ...
Olivier's user avatar
  • 1,363
4 votes
1 answer
78 views

Identity regarding the sum of products of binomial coefficients.

Consider the following toy problem Person A and Person B have $n$ and $n+1$ fair coins respectively. If they both flip all their coins at the same time, what is the probability person B has more ...
Demetri Pananos's user avatar
2 votes
1 answer
69 views

Closed form for a sum of binomial coefficients

Let $m,n,r\in\mathbb{N}\cup\{0\}.$ I am interested in finding a closed form for the sum $$\sum_{i=0}^m{{n+i}\choose{r+i}}.$$ Let $f(m,n,r)$ denote the above sum. We may make a few trivial observations....
aqualubix's user avatar
  • 2,145
2 votes
3 answers
84 views

What is the number of lattice paths of length 16 from the point (0,0) to (8,8) that go through (4,4) but don't go through (1,1), (2,2), (3,3)

what is the number of lattice paths of length 16 from $(0,0)$ to $(8,8)$ that go through $(4,4)$, don't go through $(1,1), (2,2), (3,3)$, and don't go over $y=x$? Here's what I tried: since we can't ...
user avatar
1 vote
2 answers
92 views

Alternating sum involving binomial coefficients

I want to prove that $$ \sum_{i=0}^{n}{n\choose i} \frac{\left(1 + \alpha i\right)^{n} \left(-1\right)^{n - i}}{n!} = \alpha^{n}. $$ This is a guess based on the computations for $n = 0,1,2,3$. Do you ...
stackQandA's user avatar
0 votes
1 answer
34 views

How to Derive the Binomial Coefficient Upper Bound and Final Inequality in "Scheduling Multithreaded Computations by Work Stealing"?

In the paper Scheduling Multithreaded Computations by Work Stealing under the section "Atomic accesses and the recycling game", it mentions the binomial coefficient approximation: $$ \binom{...
grzhan's user avatar
  • 3

15 30 50 per page