The vertex of this graph is the maximum
There are 10 seniors in the class, from which 4 should be chosen by the teacher. The order of the chosen students does not matter. This means that we speak of combinations. THe equation for calculating the number of possible combinations is:
C=N!/R!(N-R), where N is the total number of objects and R is the number of objects we select from the N
In our case, N=10, R=4.
C= 10!/4!*6!=10*9*8*7*6!/6!*4*3*2*1=<span>10*9*8*7/24=5040/24=210
There are 210 different ways for the teacher to choose 4 seniors in no particular order.</span>
1.-28×-28×-28+13×13×13+16×16×16
=21,952+2,197+4,096
=28,245.
2.12×12×12+-7×-7×-7+-5×-5×-5
=1,728+-343+-125
=1,260
It would be C.
For example, say 1 person comes. This would be x=1. Plugging this in gives you,
y=0.5 + 1.3
This shows that C is true since x is always going to be multiplied by 0.5.
1.3 would be the base amount of time it takes to arrange since if it the y-intercept.
Answer:
$19.35
Step-by-step explanation:
