(i) Since no student gets more than one prize; the first prize can be given to any one of the five students.
The second prize can be given to anyone of the remaining 4 students.
Similarly, the third prize can be given to any one of the remaining 3 students.
The last prize can be given to any one of the remaining 2 students.
∴ Required number of ways = 5432 = 5!
(ii) Since a student may get any number of prizes, the first prize can be given to any of the five students. Similarly, the rest of the three prizes can be given to the each of the remaining 4 students.
∴ Required number of ways = 5555 = 625
(iii) None of the students gets all the prizes.
∴ Required number of ways = {Total ways of distributing the prizes in a condition wherein a student may get any number of prizes Total ways in a condition in which a student receives all the prizes} =
625 5 = 620