Número de Bell B_n
- Created by
- Renato Passos, Eng. de Software
- Reviewed by
- Renato Passos, Eng. de Software
Last updated: Apr 18, 2026
About this calculator
The Bell number B_n calculator computes the total number of ways to partition a set of n distinct elements. These numbers are fundamental in combinatorial mathematics and set theory, appearing in problems related to grouping or categorization without overlapping subsets.
Bell numbers use the recursive formula B(n+1) = Σ C(n, k) × B(k) where k ranges from 0 to n. This means each number is the weighted sum of previous numbers multiplied by binomial coefficients. By definition, B(0) = 1 (representing the empty set).
Use this calculator in scenarios like molecular structure analysis, clustering algorithm optimization, or statistical distribution studies. It's particularly useful for n up to 20, as the sequence grows exponentially. Larger values require advanced computational methods.
Important considerations: ensure n is a non-negative integer. Avoid inputs above 25 if the implementation lacks memory optimizations. For n=0, the result will always be 1, following the standard mathematical definition.
Frequently asked questions
What is a Bell number?
It represents the number of possible partitions in a set with n elements. For example, B(3)=5 because there are 5 ways to divide 3 elements into subsets.
How does the recursive formula work?
Each B(n+1) is calculated by summing C(n,k) × B(k) for k from 0 to n, where C(n,k) is the binomial coefficient.
For which n values is this calculator effective?
It works efficiently for n up to 20. Larger values require specialized computational methods due to exponential growth.
Why is B(0) defined as 1?
By mathematical definition, the empty set has exactly one partition (itself), hence B(0) = 1.