I am studying Stirling Numbers recently based on the wikipedia information and I am currently stuck on how to prove this relationship between Stirling Number first kind and second kind with negative value.Based on the table, it is easy to see. But how they can make this conclusion. I have checked a lot of material but still could not find out the solution. Here is the link:https://en.wikipedia.org/wiki/Stirling_number#Stirling_numbers_with_negative_integral_values
2026-03-26 14:25:13.1774535113
How to prove the relationship between Stirling numbers first kind and second kind with negative integral values
241 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
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)
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?
This is explained in Concrete Mathematics 2nd ed. Graham, Knuth, Patashnik, pp. 266 & 267: the definition of $x\brace k$ and $x\brack k$ are extended to negative value of $x$ and $k$ by computing them recursively with the same recursions as for positive values of $x$ and $k$:
\begin{align*}{x-1\brace k-1}&= {x \brace k} - k{x-1\brace k}\\{x-1\brack k-1}&= {x \brack k} - (x-1){x-1\brack k}\end{align*} with the initial values (additional stipulations in the above reference) ${0\brace x}={0\brack x}={x\brace 0}={x\brack 0}=0$ for all non-zero values of $x$ and, as usual for $x=0$, ${0\brace 0}={0\brack 0}=1$.
Now, if we replace $x$ (resp. $k$) by $-x+1$ (resp. $-k+1$) in the above recursions, we have: \begin{align*}{-x\brace -k}&= {-x+1 \brace -k+1} - (-k+1){-x\brace -k+1}\\{-x\brack -k}&= {-x+1 \brack -k+1} + x{-x\brack -k+1}\end{align*} that is \begin{align*}{-x\brace - k}+(-k+1){-x\brace -k+1}&= {-x+1 \brace -k+1} \\{-x\brack -k}+ (- x){-x\brack -k+1}&= {-x+1 \brack -k+1} \end{align*}
We then see that ${-x\brace - k}$ (resp. ${-x\brack -k}$) obeys the same recursion as ${k\brack x}$ (resp. ${k\brace x}$). Since they have the same initial values, they must be equal.