Home / Science, Engineering & Maths / Combinatorics: Strategies and Methods for Counting / Bell numbers
Bell numbers
Bell numbers: counting the partitions of a give set
The number of partitions that can be formed with a set containing a given number (k) of elements is the (k)-th Bell number. Let us discover how it is related with the Stirling numbers of the second kind and how to compute it.
You can access the content of the video in the PDF file at the bottom of this step.
This article is from the online course:
Combinatorics: Strategies and Methods for Counting
Created by
This article is from the free online
Combinatorics: Strategies and Methods for Counting
Reach your personal and professional goals
Unlock access to hundreds of expert online courses and degrees from top universities and educators to gain accredited qualifications and professional CV-building certificates.
Join over 18 million learners to launch, switch or build upon your career, all at your own pace, across a wide range of topic areas.
