Skip main navigation

Let’s count – Partitions

Let's count - Partitions
© CM

Do your best in trying to solve the following problems. It is normal that this step will take some time, we recommend to perseverate and wait before looking at the solution of Exercise 1 in the video or of both in the pdf below.

Exercise 1.

Write how many ways there are to subdivide 4 people into 3 (nonempty) distinguishable groups (A, B, C) in two different ways:
a) by means of a known formula;
b) Count first partitions into 3 nonempty sets and then “label’’ the sets.

Exercise 2.

Recurrence formula for the Stirling numbers of II kind (solved in the pdf).

Let (nge 1, kge n+1). Prove that [Biglbracebegin{matrix}k newline nend{matrix}Bigrbrace=Biglbracebegin{matrix}k-1 newline n-1end{matrix}Bigrbrace+nBiglbracebegin{matrix}k – 1newline nend{matrix}Bigrbrace.] Deduce the values of the Stirling numbers of II type (Biglbracebegin{matrix}k newline nend{matrix}Bigrbrace) for (1le nle kle 4).

© CM
This article is from the free online

Combinatorics: Strategies and Methods for Counting

Created by
FutureLearn - Learning For Life

Our purpose is to transform access to education.

We offer a diverse selection of courses from leading universities and cultural institutions from around the world. These are delivered one step at a time, and are accessible on mobile, tablet and desktop, so you can fit learning around your life.

We believe learning should be an enjoyable, social experience, so our courses offer the opportunity to discuss what you’re learning with others as you go, helping you make fresh discoveries and form new ideas.
You can unlock new opportunities with unlimited access to hundreds of online short courses for a year by subscribing to our Unlimited package. Build your knowledge with top universities and organisations.

Learn more about how FutureLearn is transforming access to education