Question 173322This question is from textbook Saxon Algebra 2
: There are 5 tiles in a bag, labeled with the letters A, B, C, D, and E. The tiles are chosen at random from the bag, without replacing them, until all 5 have been removed. In how many different orders can the tiles be removed?
This question is from textbook Saxon Algebra 2
Found 3 solutions by solver91311, scott8148, checkley77:
Answer by solver91311(24713)   (Show Source):
You can put this solution on YOUR website! There are 5 ways to choose the first tile. For each of those 5 ways to choose the first tile, there are 4 ways to choose the second tile. For each of those 20 ways ( 5 X 4 ) to choose the first two tiles, there are 3 ways to choose the third, and so on.
So: 5 X 4 X 3 X 2 X 1 = 120
Mathematicians abbreviate this as 5!, read 5 factorial.
Answer by scott8148(6628)  (Show Source):
You can put this solution on YOUR website! there are 5 different 1st tiles; 4 different 2nd tiles; 3 different 3rd tiles; etc.
so the possible permutations (orders) are 5*4*3*2*1 or 120
Answer by checkley77(12844)  (Show Source):
|
|
|
