A counting problem

Consider three boxes , each containing 10 10 balls labelled 1 , 2 , , 10 1,2,\cdots ,10 .Suppose one ball is drawn from each of the boxes . Denote by n i n_i ,the label of the ball drawn from the i i -th box , i = 1 , 2 , 3 i=1,2,3 .Then , the number of ways in which the balls can be chosen such that n 1 < n 2 < n 3 n_1<n_2<n_3 , is ?

120 160 150 130

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.

2 solutions

Choose 3 3 distinct integers from { 1 , 2 , 3 , . . . . , 10 1,2,3,....,10 } and assign the least of these to n 1 n_{1} , the next least to n 2 n_{2} and the greatest to n 3 n_{3} . This can be done in ( 10 3 ) = 120 \dbinom{10}{3} = \boxed{120} ways and accounts for all the ways in which the balls can be chosen such that n 1 < n 2 < n 3 n_{1} \lt n_{2} \lt n_{3} .

Jc 506881
Jan 28, 2018

Given n 2 n_2 , there are n 2 1 n_2 - 1 choices for n 1 n_1 and 10 n 2 10 - n_2 choices for n 3 n_3 . So, the total number of ways the balls can be chosen such that n 1 < n 2 < n 3 n_1 < n_2 < n_3 is: n 2 = 1 10 ( n 2 1 ) ( 10 n 2 ) = 120 \sum_{n_2 = 1}^{10} (n_2 - 1)(10 - n_2) = 120

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...