Question: There are 27 identical cakes to be distributed to 8 children.
a) How many ways can you do so with no further restrictions?
b) How many ways can you distribute the cakes such that each child receives at least 2 cakes?
c) Show that at least 2 children will receive the same number of cakes.
I understand how to do parts (a) and (b) by using the placeholders and separators method (I've included them anyways just in case it helps) but I'm uncertain what to do for part (c)? My instincts from what I've been learning so far tells me that it's something related to the Pigeonhole Principle but I'm not too sure.
Start by giving each child a different number of cakes. Let kid 1 get one cake, kid 2 get two cakes and so on. After kid 6, $21$ cakes have been given out and you do not have 7 more cakes. Hence the remaining two kids (7 and 8) will have to get cakes with the sum being 7 cakes. But since 1, 2, 3, 4, 5 and 6 cakes have already been given out, each of the two will the same number of cakes as someone before.