How many ways are there to invite 1 out of 3 friends every night for dinner on 6 successive nights such that no friend is invited more than 3 times ?
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.
This solution is for all beginners, completely explained reasoning.
As we want total nights to be 6 , the number of nights for which friend was invited can be ( 3 , 3 ) or ( 3 , 2 , 1 ) or ( 2 , 2 , 2 )
These are the only cases.
Number of ways in which each case is possible is w f × w n × w a where w f = ways of choosing the friends w n = ways of assigning them the number of nights w a = ways of arranging their nights among the 6
1 . ( 3 , 3 )
Ways of choosing 2 friends for inviting- ( 2 3 ) = 3
Ways of assigning them the number of nights- 1 (giving 3 to each)
Ways of arranging them in those 6 nights - ( 3 6 ) × ( 3 3 ) = 2 0
Ways in which the case is possible - 3 × 1 × 2 0 = 6 0
2 . ( 3 , 2 , 1 )
Ways of choosing friends for inviting = ( 3 3 ) = 1
Ways of assigning them the number of nights (3 or 2 or 1) = 3 ! = 6
Ways of arranging their invites over the 6 nights - ( 3 6 ) × ( 2 3 )
Ways in which the case is possible- 6 × 2 0 × 3 = 3 6 0
3 . ( 2 , 2 , 2 )
Ways of choosing friends - ( 3 3 ) = 1
Ways of assigning them the number of nights - 1 (giving 2 to each of them)
Ways of arranging their invites over the 6 nights - ( 2 6 ) × ( 2 4 ) = 1 5 × 6 = 9 0
Ways in which the case is possible 1 × 1 × 9 0 = 9 0
Hence total number of ways 6 0 + 3 6 0 + 9 0 = 5 1 0