$$\sum_{i,j}{n\brack i+j}\binom{i+j}i$$ Does this have a combinatorial interpretation? I don't see how to use Stirling numbers of the first kind in interpretations. I know that the answer is $(n+1)!$ , but the original question didn't provide it.
2026-03-29 02:12:29.1774750349
Combinatorial interpretation of a sum with Stirling numbers
199 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in SUMMATION
- Computing:$\sum_{n=0}^\infty\frac{3^n}{n!(n+3)}$
- Prove that $1+{1\over 1+{1\over 1+{1\over 1+{1\over 1+...}}}}=\sqrt{1+\sqrt{1+\sqrt{1+\sqrt{1+...}}}}$
- Fourier series. Find the sum $\sum_{n=1}^\infty \frac{(-1)^{n+1}}{2n+1}$
- Sigma (sum) Problem
- How to prove the inequality $\frac{1}{n}+\frac{1}{n+1}+\cdots+\frac{1}{2n-1}\geq \log (2)$?
- Double-exponential sum (maybe it telescopes?)
- Simplify $\prod_{k=1}^{l} \sum_{r=d}^m {{m}\choose{r}} \left(N-k \right)^{r} k^{m-r+1}$
- Sum of two martingales
- How can we prove that $e^{-jωn}$ converges at $0$ while n -> infinity?
- Interesting inequalities
Related Questions in BINOMIAL-COEFFICIENTS
- Newton binomial expansion
- Justify an approximation of $\sum_{n=1}^\infty G_n/\binom{\frac{n}{2}+\frac{1}{2}}{\frac{n}{2}}$, where $G_n$ denotes the Gregory coefficients
- Solving an equation involving binomial coefficients
- Asymptotics for partial sum of product of binomial coefficients
- What is wrong with this proof about a sum of binomial coefficients?
- Find sum of nasty series containing Binomial Coefficients
- Alternating Binomial Series Summation.
- $x+\frac{1}{x}$ is an integer
- Finding value of $S-T$ in $2$ binomial sum.
- how to reduce $(1-\alpha)^{T-i}$ into a sum
Related Questions in STIRLING-NUMBERS
- About the corvergence of series involving Stirling numbers of first kind and number theoretic functions
- Algebraic derivation of the recurrence for Stirling numbers of the second kind
- A sum involving Stirling numbers of the second kind.
- Number of entries are not divisible by x in the n th row of triangle
- odd property of Eulerian numbers
- Statistics: Using Stirling's Approximation with $3 N$
- General form of the coefficients of the polynomial $p(z)=\binom{q+z}{n}+\binom{q-z}{n}$
- Combinatorial proof for a Stirling identity
- How can I find $f(a,b,c)=e^{-c^a/a}\sum\limits_{n=0}^{\infty}\left(\frac{c^a}{a}\right)^{n}\frac{(an)^{b}}{n!}$?
- Asymptotic formula for the integral sequence s(n)
Related Questions in COMBINATORIAL-PROOFS
- Proof of (complicated?) summation equality
- Prove combination arguments $c(c(n,2),2) = 3c(n,3)+3c(n,4)$
- A Combinatorial Geometry Problem With A Solution Using Extremal Principle
- What is the least position a club in EPL can finish with 30 wins?
- Find a combinatorial proof for $\binom{n+1}{k} = \binom{n}{k} + \binom{n-1}{k-1} + ... + \binom{n-k}{0}$
- Use combinatorial arguments to prove the following binomial identities
- money changing problem
- $\forall n\in\mathbb N,x>-1,(1+x)^n\ge1+nx$ Using 2nd Derivative
- Combinatorial proof of $\sum\limits_{i=0}^{r} ({m \choose i}) = {{m + r}\choose m}$
- Intersection of $n$ circles and $m$ lines
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
I'm not sure about a direct combinatorial proof, but the solution can be easily obtained by taking $k=i+j$ and using the known formula $\sum_{k} \genfrac[]{0pt}{}{n}{k} x^k = x^{\overline{n}}$, where $x^{\overline{n}}$ denotes the rising factorial.
$$\sum_{i,j} \genfrac[]{0pt}{}{n}{i+j} \binom{i+j}{i} = \sum_{k} \genfrac[]{0pt}{}{n}{k} \sum_{i} \binom{k}{i} = \sum_{k} \genfrac[]{0pt}{}{n}{k} 2^k = 2^{\overline{n}} = (n+1)!$$