- In a shop there are
k
kinds of postcards. We want to send postcards to
n friends. How many different ways can this be done?
N1=kn
What happens if we want to send them different cards?
N2=P(k,n)
What happens if we want to send two different cards to each of them(but different persons may get the same card)?
N3=P(C(k,2),n) - We have
k
distinct postcards and want to send them all to our
n friends (a friend can get any number of postcards, including 0). How many ways can this be done?
N1=(n+k−1)!(n−1)!
What happens if we want to send at least one card to each friend?
N2=C(k−1,n−1) - How many anagrams can be formed from the word CHARACTERIZATION? (An anagram is a word having the same letters, each occurring the same number of times; this second word does not need to have a meaning.)
N=16!3!⋅2!⋅2!⋅2!⋅2!=217945728000 - (a) How many possibilities are there to distribute
k
forints among
n people so that each receives at least one?
Na=C(k−1,n−1)
(b) Suppose that we do not insist each perso n receive something. What will be the number of distributions in this case?
Nb=(n+k−1)!k!⋅(n−1)! - There are
k
kinds of postcards, but only in a limited number of each, there being
ai copies of the ith one. What is the number of possible ways of sending them to n friends? (We may send more than one copy of the same postcard to the same person).
N=(∑ki=1ai)!⋅C(∑ki=1ai−1,n−1)∏ki=1ai! - (a) Find recurrence relations for the Stirling partition numbers
{nk}
and the Stirling cycle numbers
[nk]
, and tabulate them for
n≤6
Stirling Number of the 1st kind:
[nk]=[n−1k−1]+(n−1)⋅[n−1k]
n0123456010000001112624120213115027431635225411085511561
Stirling Number of the 2nd kind:
{nk}={n−1k−1}+k⋅{n−1k}
n0123456010000001111111213715313162590411065511561
(b) Prove that {nn−k} and [nn−k] are polynomials in n for each fixedk .
???
(c) Show that there is a unique way to extend the definition of {nk} and [nk] over all integers n andk so that the recurrence relations in (a) are preserved and the “boundary conditions” {00}=[00]=1 and {0m}=[m0]=0(m≠0) are fulfilled.
???
(d) Prove the duality relation
{nk}=[−k−n]
???
Combinatorial Problems and Exercises - 1. Basic enumeration(1)
最新推荐文章于 2024-04-10 09:07:04 发布