There are eight students. Each student is competing for 1st, 2nd, 3rd and 4th violin chair. We will use permutation to solve this problem.
When we have 'n' items and we want to find the number of ways 'k' items can be ordered. Then we use the permutation formula which states:
Therefore,
=
=
=
= 1680
Therefore, in 1680 different ways can all four chairs be filled.