∑ZWMath CoursesSyllabusExercises
ES
ZWMath›Enumerative combinatorics›Classical combinatorial numbers›Stirling number of the second kind›ZW-STIRLING-NUMBER-OF-THE-SECOND-KIND-008
Course menu
AreaCombinatoricsCourseEnumerative combinatoricsTopicClassical combinatorial numbers
Generating functions3
  • Multinomial coefficient
  • Exponential generating function
  • Binomial coefficient Discrete mathematics
Classical combinatorial numbers7
  • Stirling number of the second kind
  • Bell number
  • Stirling number of the first kind
  • Catalan number
  • Derangement
  • Cycle of a permutation Modern algebra I
  • Inclusion-exclusion principle Discrete mathematics
Compositions and partitions4
  • Integer composition
  • Integer partition
  • Partition generating function
  • Pentagonal number theorem
Symmetry and counting2
  • Burnside's lemma
  • Orbit and stabilizer Modern algebra I
Posets and lattices2
  • Lattice or order theory
  • Partial order relation Discrete mathematics
Extremal combinatorics1
  • Steiner triple system

Exercise · ZW-STIRLING-NUMBER-OF-THE-SECOND-KIND-008 · ★★☆ Intermediate

Add the values S(3,k) for k=1,2,3 and state which Bell number this is.

Choose one option.

Show answer
  • D. 5

← Back to the question

Explanation

S(3,1)+S(3,2)+S(3,3)=1+3+1=5, which is the Bell number B_3. The value 7 comes from mistakenly adding S(3,2) twice.

Study Enumerative combinatorics in ZWMath →

Review the concept: Stirling number of the second kind

The Stirling number of the second kind S(n,k) counts the partitions of a set of n elements into k nonempty, indistinguishable blocks.

\[S(n,k)=kS(n-1,k)+S(n-1,k-1)\]

More practice problems: stirling number of the second kind

  • ZW-STIRLING-NUMBER-OF-THE-SECOND-KIND-001 How many partitions of a 3-element set into 2 nonempty blocks exist?
  • ZW-STIRLING-NUMBER-OF-THE-SECOND-KIND-002 State the value of S(n,n) for any n≥1.
  • ZW-STIRLING-NUMBER-OF-THE-SECOND-KIND-003 State what the Stirling number S(n,k) counts.
  • ZW-STIRLING-NUMBER-OF-THE-SECOND-KIND-004 What is the value of S(n,1) for n≥ 1?
  • ZW-STIRLING-NUMBER-OF-THE-SECOND-KIND-005 What is S(n,k) when k>n?
  • ZW-STIRLING-NUMBER-OF-THE-SECOND-KIND-006 Use the recurrence to compute S(4,2).
  • ZW-STIRLING-NUMBER-OF-THE-SECOND-KIND-007 Compute S(4,3) using S(n,k)=kS(n-1,k)+S(n-1,k-1) and S(3,3)=1.
  • ZW-STIRLING-NUMBER-OF-THE-SECOND-KIND-009 How many ordered partitions of 3 elements into 2 nonempty blocks exist?

← ZW-STIRLING-NUMBER-OF-THE-SECOND-KIND-007 ZW-STIRLING-NUMBER-OF-THE-SECOND-KIND-009 →

Practice

⏱Exam simulator10 random questions with a grade☰All exercises
◉Open on course✦Open on free study↗Open on the map

ZWMath · Math from definition to practice. Open the interactive map · Syllabus · All exercises

Author: ORCID iD 0009-0009-8641-3511

Privacy · About Speedrunz · Contact