Harrison has 3 friends. If N is the number of ways he can invite one friend everyday for dinner on 6 successive nights so that no friend is invited more than 3 times, the what is the value of (N/170) ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I have more than 3 friends :)
Anyways, we will use complementary counting to solve this problem. There are a total of 3 6 ways for me to invite my friends over with no restrictions.
If a friend comes four times and another two times, this is the same as 3 ⋅ 2 ⋅ 4 ! ⋅ 2 ! 6 ! = 9 0 ways.
(This is because there are 3 ways to choose the first friend and 2 ways to choose the second friend multiplied by the number of ways to arrange them).
If a friend comes four times and the other two come once, this is the same as 3 ⋅ 4 ! 6 ! = 9 0 ways
If a friend comes five times and the other comes once, then this equals 3 ⋅ 2 5 ! 6 ! = 3 6 ways
If a friend comes all six times, then this obviously equals 3
So our total is equivalent to 3 6 − 9 0 − 9 0 − 3 6 − 3 = 5 1 0 ⟹ 3