Answer:
Mr.Pratt can select three students to win these awards in 2,600 ways.
Step-by-step explanation:
In mathematics, the procedure to select k items from n distinct items, without replacement, is known as combinations.
The formula to compute the combinations of k items from n is given by the formula:
![{n\choose k}=(n!)/(k!(n-k)!)](https://img.qammunity.org/2021/formulas/mathematics/college/y5kg37io9k9rsp83yxi4epm2na4n54n2j8.png)
Mr. Pratt has three prizes to give away.
The total number of students in his class is, n = 26.
He has k = 3 prizes, namely a pencil, an eraser, and a homework pass.
Compute the number of combinations of three students Mr. Pratt can select from 26 students to give away the prizes as follows:
![{n\choose k}=(n!)/(k!(n-k)!)](https://img.qammunity.org/2021/formulas/mathematics/college/y5kg37io9k9rsp83yxi4epm2na4n54n2j8.png)
![=(26!)/(3!(26-3)!)](https://img.qammunity.org/2021/formulas/mathematics/middle-school/5abewbwb27592zfba35kxyfkgyo98yi24r.png)
![=(26!)/(3!* 23!)](https://img.qammunity.org/2021/formulas/mathematics/middle-school/42zhh81le5psbn5zxr6e7af07zzb1x03ub.png)
![=(26*25*24*23!)/(3!*23!)](https://img.qammunity.org/2021/formulas/mathematics/middle-school/dn4r5l9k6yb2gi2q63cjy5bzucjjagukcu.png)
![=2600](https://img.qammunity.org/2021/formulas/mathematics/middle-school/rbtotvqmw8v5tooz9gbx17bzn5b7ybkpo6.png)
Thus, Mr.Pratt can select three students to win these awards in 2,600 ways.