Answer:
32760 ways.
Step-by-step explanation:
Total number of students = 15
Possible ways to select a student for first position out of 15 = 15
Now one student is selected. So remaining students is 14.
Possible ways to select a student for second position out of 14 = 14
Similarly,
Possible ways to select a student for third position out of 13 = 13
Possible ways to select a student for fourth position out of 12 = 12
So, the number of ways in which contestants can win first, second, third, and fourth is
Required ways [tex]=15\times 14\times 13\times 12[/tex]
[tex]=32760[/tex]
Therefore, the contestants can win first, second, third, and fourth in 32760 ways.
