Skip main navigation

Sharings into nonempty sets

Sharings into nonempty sets

We learn here how to count the number of distributions of different objects into distinguishable boxes in such a way that no box remains empty. For instance, assume a hostel has got 3 big rooms A, B, C. How many ways are there to distribute 14 students in the 3 rooms in such a way that each room has at least a student? Translated into mathematical terms this is counting the number of sharings of a finite set into a prescribed number nonempty sets.

You can access the content of the video in the PDF file at the bottom of this step.

This article is from the free online

Combinatorics: Strategies and Methods for Counting

Created by
FutureLearn - Learning For Life

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.

Start Learning now