Numbered

In the past, passengers on public transport validated single-use tickets that had 9 numbered boxes, a certain number of which were punched with a validator.
A) In how many different ways could a ticket be validated if 3 boxes were punched?
B) In how many ways could a ticket be validated if 6 boxes were punched?

Final Answer:

n1 =  84
n2 =  84

Step-by-step explanation:

C3(9)=(39)=3!(93)!9!=321987=84  n1=(39)=84
C6(9)=(69)=6!(96)!9!=321987=84  n2=(69)=84



Help us improve! If you spot a mistake, please let let us know. Thank you!







Tips for related online calculators
Would you like to compute the count of combinations?
See also our permutations calculator.

You need to know the following knowledge to solve this word math problem:

Related math problems and questions: