Rahul@gurome wrote:
Number of triplets (x < y < z) = Number of ways to select 3 integers out of 10 = 10C3 = 120
Number of triplets (x = y < z) = Number of doublets (x < z) = Number of ways to select 2 integers out of 10 = 10C2 = 45
I´ve tried to avoid this approach because I believe it is a bit "harder-than-necessary", in the sense that we must "justify" (at least to ourselves) why this way of counting is correct... well, let´s do it!
When you select 3 integers out of 10 BY COMBINATION, you mean you are counting (for instance) the 3! = 6 selections (1,2,3) , (2,1,3), ... , (3,2,1) as just one or, in other words, we are selecting one "representative" from these 6 possibilities.
The "trick" (and beauty) is the fact that we may ASSUME that the choice was exactly the one we are looking for, that is, the only one for which we have x<y<z ....
The same argument is necessary to justify Rahul´s selection BY COMBINATION of 2 integers out of 10... but now we have also the task to "justify" (at least to ourselves) why we don´t need to "bother" with the third choice... the reason is because Rahul is "admitting" that he will choose x and z, in the DESIRED order x < z (as explained in the previous paragraph), and that y will be taken as the same value of x !! In other words, y has "no choice" but to be the same as x, therefore we don´t need to "bother" counting y as far as we are counting x successfully.
Well, I hope I was understood. That´s certainly a beautiful approach to the problem but I guess it´s a bit more risky (to be found) by the average student.
Regards,
Fabio.
