Question

A bag contains 9 tiles, each with a different number from 1 to 9. You choose a tile without looking, put it aside, choose a second tile without looking, put it aside, then choose a third tile without looking. In how many different ways can you choose three tiles

Answer 1

Using the combination formula, it is found that there are 84 ways to choose the three tiles.

The order in which the tiles are chosen is not important, hence the combination formula is used to solve this question.

What is the combination formula?

$C_{n,x}$ is the number of different combinations of x objects from a set of n elements, given by:

$C_{n,x} = \frac{n!}{x!(n-x)!}$

In this problem, three tiles are chosen from a set of nine, hence:

$C_{9,3} = \frac{9!}{3!6!} = 84$

There are 84 ways to choose the three tiles.

More can be learned about the combination formula at brainly.com/question/25821700