Answer:idk
Step-by-step explanation:I just got here
Answer:
C
Step-by-step explanation:
(3.6xy^5)(2.5x^2y^-2)
9x^3y^3
I can’t see the image can you post it please or just tell me what the problem is
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
Answer:
9x -7
Step-by-step explanation:
8x-6+x-1
Combine like terms
8x +x -6-1
9x -7