SOLUTION: In a town fiesta singing competition with 12 contestants, in how many ways can the organizer arrange the first three singers?

Algebra ->  Permutations -> SOLUTION: In a town fiesta singing competition with 12 contestants, in how many ways can the organizer arrange the first three singers?      Log On


   

Question 1173648: In a town fiesta singing competition with 12 contestants, in how many ways can the organizer arrange the first three singers?
Found 2 solutions by greenestamps, ikleyn:
Answer by greenestamps(13200) About Me  (Show Source):
You can put this solution on YOUR website!


"arrange" means that order matters, so this is a permutation.

P(12,3) = number of ways of arranging 3 things chosen from among 12.

12 choices for the first; then 11 for the second; and last 10 choices for the third.

Total number of arrangements: 12*11*10 = 1320.

Answer by ikleyn(52781) About Me  (Show Source):
You can put this solution on YOUR website!
.

In 12*11*10 = 1320 ways.

Such problems were solved and explained several times last week.

See, for example, this link

https://www.algebra.com/algebra/homework/Permutations/Permutations.faq.question.1173261.html

https://www.algebra.com/algebra/homework/Permutations/Permutations.faq.question.1173261.html