A probability problem by Aman Goenka

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 ?


The answer is 510.

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.

1 solution

Aditya Raut
Sep 12, 2014

This solution is for all beginners, completely explained reasoning.

As we want total nights to be 6 6 , the number of nights for which friend was invited can be ( 3 , 3 ) (3,3) or ( 3 , 2 , 1 ) (3,2,1) or ( 2 , 2 , 2 ) (2,2,2)

These are the only cases.


Number of ways in which each case is possible is w f × w n × w a w_f \times w_n \times 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 w_f =\text{ways of choosing the friends} \\ w_n = \text{ways of assigning them the number of nights} \\ w_a = \text{ ways of arranging their nights among the 6}


1. \mathbf{1.} ( 3 , 3 ) (3,3)

Ways of choosing 2 friends for inviting- ( 3 2 ) = 3 \binom{3}{2}=3

Ways of assigning them the number of nights- 1 (giving 3 to each)

Ways of arranging them in those 6 nights - ( 6 3 ) × ( 3 3 ) = 20 \binom{6}{3} \times \binom{3}{3}=20

Ways in which the case is possible - 3 × 1 × 20 = 60 3\times 1\times 20=60


2. \mathbf{2.} ( 3 , 2 , 1 ) (3,2,1)

Ways of choosing friends for inviting = ( 3 3 ) = 1 \binom{3}{3}=1

Ways of assigning them the number of nights (3 or 2 or 1) = 3 ! = 6 3!=6

Ways of arranging their invites over the 6 nights - ( 6 3 ) × ( 3 2 ) \binom{6}{3} \times \binom{3}{2}

Ways in which the case is possible- 6 × 20 × 3 = 360 6\times 20\times 3 = 360


3. \mathbf{3.} ( 2 , 2 , 2 ) (2,2,2)

Ways of choosing friends - ( 3 3 ) = 1 \binom{3}{3}=1

Ways of assigning them the number of nights - 1 1 (giving 2 to each of them)

Ways of arranging their invites over the 6 nights - ( 6 2 ) × ( 4 2 ) = 15 × 6 = 90 \binom{6}{2} \times \binom{4}{2} =15\times 6=90

Ways in which the case is possible 1 × 1 × 90 = 90 1\times 1\times 90 = 90


Hence total number of ways 60 + 360 + 90 = 510 60+360+90=\boxed{510}

This problem has 2 solvers, namely me and the person who wrote this problem. Then how did it get 2 2 upvotes ? I am amazed ! At the max, it should be 1 1 , because there is just 1 other solver !

@Krishna Ar

Aditya Raut - 6 years, 9 months ago

Log in to reply

People who don't solve and choose to see the solution can also upvote.

Siddhartha Srivastava - 6 years, 9 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...