Dear Allstats,
Here is typical problem in combinatorics. I would be grateful if somebody could throw some light on it.
There are 20 people standing in a line in front of a counter to buy tickets. Each of the persons is going to buy one ticket only. Cost of a ticket is Rs. 5. Ten people standing in the line have a 10 Rupee note and the rest ten people standing in the line have a 5 Rupee note. Assuming that the person sitting at the counter do not have any change with him initially, what are the total number of ways in which the twenty people can stand in the line so that the person sitting at the counter will have no problem in selling the tickets.
Indrajit Sen Gupta.
---------------------------------
Do you Yahoo!?
Yahoo! Domains - Claim yours for only $14.70/year
|