The first four terms in a linear sequence are shown below.
1 answer:
You might be interested in
There are 91 such ways in whih the volunteers can be assigned if two of them cannot be assigned from 14 volunteers.
Given that a school dance committee has 14 volunteers and each dance requires 3 volunteers at the door, 5 volunteers on the floor and 6 on floaters.
We are required to find the number of ways in which the volunteers can be assigned.
Combinations means finding the ways in which the things can be choosed to make a new thing or to do something else.
n=n!/r!(n-r)!
Number of ways in which the volunteers can be assigned is equal to the following:
Since 2 have not been assigned so left over volunteers are 14-2=12 volunteers.
Number of ways =14
=14!/12!(14-12)!
=14!/12!*2!
=14*13/2*1
=91 ways
Hence there are 91 such ways in whih the volunteers can be assigned if two of them cannot be assigned.
Learn more about combinations at brainly.com/question/11732255
#SPJ1