Question

20) Solve the problem. Suppose that 12 unique names are put into a hat and drawn at random without
replacement. How many different ways can you draw all of the names from the hat? Remember that
"without replacement" means that the names are not returned to the hat after they are chosen. Write your
answer in factorial notation.
SHOW WORK: None to be shown
A) 12!
B) 11!
C) 10!
D) 12! - 1

Answer 1

the answer would be A) 12 because there are only twelve names

Answer 2

The number of different ways is 12! you can draw all of the names from the hat without replacement option (A) 12! is correct.

What are permutation and combination?

A permutation is the number of different ways a set can be organized; order matters in permutations, but not in combinations.

It is given that:

Number of unique names = 12

That 12 unique names are put into a hat and drawn at random without

replacement.

"Without replacement" means that the names are not returned to the hat after they are chosen.

Number ways (without replacement) = 12x11x10x9x8x7x6x5x4x3x2x1

Number ways (without replacement) = 12!

Thus, the number of different ways is 12! you can draw all of the names from the hat without replacement option (A) 12! is correct.

Learn more about permutation and combination here:

https://brainly.com/question/2295036

#SPJ2