Atest consists of 20 problems and students are told to answer any 15 of these questions. in how many different ways can they choose the 15 questions?

Since order is not important, we are looking for unique combinations. For this type of problem you use the "n choose k" equation.

n!/(k!(n-k)!), where n=total amount of choices, k=number of choices made.

In this case:

20!/(15!(20-15)!)

20!/(15!*5!)

15504

Add the cents that add the left overs to get the first number