The president of the college asked a fraternity to submit a list of 55 students to serve as security at a school function. They have 1919 students who are available to help. In how many ways can the students be chosen?

1.34 * 10^107 ways

Step-by-step explanation:

In this question, we are asked to calculate the number of ways in which we can select 55 students from a total of 1919 students.

Since this is a selection problem, we use combination to solve it.

Mathematically;

nCr = n!/(n-r)!r!

From the question, we identify n as 1919 and r as 55

So we have;

1919C55 = 1919!/(1919-55)!55!

= 1.34 * 10^107 ways

idn

step-by-step explanation: