I have just learnt Stirling number of the 2nd kind and I was also given a hint that this involves the pigeonhole theorem, but I have no idea how to approach this question. Any help would be much appreciated!
2026-03-29 18:34:34.1774809274
Stirling number of the 2nd kind with pigeonhole theorem
111 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in PIGEONHOLE-PRINCIPLE
- Is it possible to make a computer network of 75 computers
- Pigeonhole principle: prove that a class of 21 has at least 11 male or 11 female students.
- Proving that a set of 2016 natural numbers contain a non-empty set with a sum divisible by 2016
- Question on proof of Erdos and Szekeres
- Pigeon Hole Principle Proof integrated with sets
- # of vertices and # of connected components proof problem?
- Prove that any collection of 8 distinct integers contains distinct x and y such that x - y is divisible by 7.
- Hint for problem on $4 \times 7$-chessboard problem related to pigeonhole principle
- Pigeonhole principle subsets
- $80$ balls in a row. $50$ of them are yellow and $30$ are blue. Prove that there are at least $2$ blue balls with a distance of exactly $3$ or $6$.
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?

Hint: First remember that ${n\brace k}$ means the number of ways to partition $n$ elements into $k$ non empty blocks (without any order).
If you have $3$ out of the $n$ elements in a block, how many elements are left? How many blocks are left? So how many elements per block are there left? (notice that there are $n-3$ elements and $n-3$ blocks, so there should be one element per block. Otherwise, one block would be empty!) That gives you $\binom{n}{3}\cdot 1,$ because you just have to care who are the elements that are together in the block of $3$ elements, the rest of them are in individual singletons.
Now you do not want to put $3$ elements in one block (you have done it before!), but then the maximal number of elements in one block has to be $2$(Pidgeon principle again) and so the two remaining elements ($n-(n-2)=2$ from the ones that have to determine a block) have to be put in two different blocks.
You have, then, $2$ blocks in which there are two elements each. Choose the $2$ elements for the first block in $\binom{n}{2}$ ways and, from the remaining $n-2,$ choose the other $2$ in $\binom{n-2}{2}$ ways. Notice that we use the word first, so we are giving this $2$ blocks an order. We can not do this! Eliminate the order.
Example: Suppose $n=4,$ then $n-2=2$ notice that we can have the following distribution. Either there is one element alone, which forces to have $3$ elements in the other block like in $\{\{1\},\{2,3,4\}\}$ or there are two blocks containing $2$ elements like in $\{\{1,2\},\{3,4\}\}.$
Notice that to create the first way we can choose who are the elements that are in the block of $3$ elements. In how many ways? $\binom{4}{3}.$ Notice that the remaining objects is forced to be alone in another block (so we do not have to do anything to take this into consideration).
For the second way, we want to choose the two pair of elements that are together. We can do this as $\binom{4}{2}$ to choose the first two, and then, from the remainder $4-2=2$ we can choose the other two. We get, by multiplication principle, $\binom{4}{2}\binom{2}{2}$ ways. The problem, tho, is that you gave this blocks an order, to take out the two possible orders, you divide by $2$ giving you $\frac{1}{2}\binom{4}{2}\binom{2}{2}.$
Putting the two ways together, you get your result.