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
28000 / 5 days = $5,600 per day
Wednesday, Thursday, Friday = 3 days.
5,600 x 3 days = $16,800
The amount should be $16,800
Answer:
x = 20
Step-by-step explanation:
Intersecting Chords Theorem: ab = cd
Step 1: Label our variables
<em>a</em> = x
<em>b</em> = x - 11
<em>c</em> = x - 8
<em>d</em> = x - 5
Step 2: Plug into theorem
x(x - 11) = (x - 5)(x - 8)
Step 3: Solve for <em>x</em>
x² - 11x = x² - 8x - 5x + 40
x² - 11x = x² - 13x + 40
-11x = -13x + 40
2x = 40
x = 20
12 of them are black
2 of them is yellow
2 of them are both