Consider three boxes , each containing 1 0 balls labelled 1 , 2 , ⋯ , 1 0 .Suppose one ball is drawn from each of the boxes . Denote by n i ,the label of the ball drawn from the i -th box , i = 1 , 2 , 3 .Then , the number of ways in which the balls can be chosen such that n 1 < n 2 < n 3 , is ?
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.
Given n 2 , there are n 2 − 1 choices for n 1 and 1 0 − n 2 choices for n 3 . So, the total number of ways the balls can be chosen such that n 1 < n 2 < n 3 is: n 2 = 1 ∑ 1 0 ( n 2 − 1 ) ( 1 0 − n 2 ) = 1 2 0
Problem Loading...
Note Loading...
Set Loading...
Choose 3 distinct integers from { 1 , 2 , 3 , . . . . , 1 0 } and assign the least of these to n 1 , the next least to n 2 and the greatest to n 3 . This can be done in ( 3 1 0 ) = 1 2 0 ways and accounts for all the ways in which the balls can be chosen such that n 1 < n 2 < n 3 .