in a certain general assembly three major prizes are at stake. in how many ways can the first, second, third prizes be drawn from a bix containing 50 names
The problem is asking how many ways can the prizes be drawn from a box containing 120 names. This is a permutation problem because order does matter or we are following a certain arrangement or sequence (1st, 2nd and 3rd).
Th formula for permutation is
, n is the total number of elements to choose from and r is the number of elements we should choose. So we have,
n= 120
r=3 , since there are 3 places.
Solve.



Conclusion
Therefore there are 1,685,040 ways the first, second, and third prizes can be drawn from the box.
Answers & Comments
1,685,040 ways
Step-by-step explanation:
The problem is asking how many ways can the prizes be drawn from a box containing 120 names. This is a permutation problem because order does matter or we are following a certain arrangement or sequence (1st, 2nd and 3rd).
Th formula for permutation is
, n is the total number of elements to choose from and r is the number of elements we should choose. So we have,
n= 120
r=3 , since there are 3 places.
Solve.



Conclusion
Therefore there are 1,685,040 ways the first, second, and third prizes can be drawn from the box.