The function "choose k from n", nCk, is defined as
nCk = n!/(k!*(n-k)!) . . . . . where "!" indicates the factorial
a) No position sensitivity.
The number of possibilities is the number of ways you can choose 5 players from a roster of 12.
12C5 = 12*11*10*9*8/(5*4*3*2*1) = 792
You can put 792 different teams on the floor.
b) 1 of 2 centers, 2 of 5 guards, 2 of 5 forwards.
The number of possibilities is the product of the number of ways, for each position, you can choose the required number of players from those capable of playing the position.
(2C1)*(5C2)*(5C2) = 2*10*10 = 200
You can put 200 different teams on the floor.
Comparing map distance to real distance we get 2cm/4km. That means 1cm = 2km.
So the map distance is half the real distance (well, technically not as one is in cm and the other in km but it’s enough to think this way) and a real distance of 10km must mean a map distance of half that (again ignoring the units) so we get 5cm.
It has no solution because it is not factorable
Answer:
c
Step-by-step explanation:
This is a parabola, so it is a quadratic parent function.
