Sign In
The number of combinations _n C_r is the number of ways we can choose r elements from n elements when the selection order is not important. |
In our case, n= 900, since we choose the board from 900 students, and r= 12, since any chosen board contains 12 students. This means we have _(900) C_(12) ways of choosing a board. We can put this expression into a calculator to get its approximate value. _(900) C_(12) ≈ 4.48 * 10^(26)
The number of combinations _n C_r is the number of ways we can choose r elements from n elements when the selection order is not important. |
Let's say Mariko was chosen as a member. The board needs 11 other members, so r = 11. Since Mariko is a student, we choose 11 students from all students except Mariko. As a result, n = 1000-1 = 900. This means there are _(899) C_(11) ways of choosing the board that have Mariko as a member. Let's approximate this number.
_(899) C_(11) ≈ 7.30 * 10^(24)No. of boards with Mariko ≈ 7.30 * 10^(24), No. of boards ≈ 4.48 * 10^(26)
Use a calculator
Convert to percent
Round to 2 decimal place(s)