In how many ways can 13 students be selected from a group of 15 students to serve on a chalkboard-cleaning team?
This is a combination problem, not a permutation problem, because the order does not matter. The formula for the number of combinations of n objects taken r at a time is nCr = n! / (r! (n - r)!), where n! means n factorial, or the product of all positive integers from 1 to n. In this case, n = 15 and r = 13, so I need to plug these values into the formula. I get 15C13 = 15! / (13! (15 - 13)!) = 15! / (13! 2!) = (15 * 14 * 13!) / (13! * 2 * 1) = (15 * 14) / (2 * 1) = 105. 