There are 10 roller coasters at 6 flags, and you only have time to ride 3 before the park closes. how many different ways can you create a path to 3 different roller coasters?

a. 120

b. 210

c. 720

d. 151,200

  120

Step-by-step explanation:

If order doesn't matter, there are 10 ways to chose the first ride, 9 ways to choose the second, and 8 ways to choose the third. This product (720) has you riding the same 3 coasters in 6 different orders. Dividing by 6 gives ...

  720/6 = 120 different combinations of roller coasters

This number might be written as 10C3 (choose 3 from 10). The meaning of that notation is ...

  nCk = n!/(k!(n-k)!)

  10C3 = 10!/(3!·7!) = 10·9·8/(3·2·1) = 120

answer: evaluate the objective function at each vertex to determine which - and -values, if any, maximize or minimize the function. example: find the minimum value and maximum value of the objective function f ( x , y ) = 4 x + 5 y , subject to the following constraints

i need more info. are you looked to see there mph? how much they deliver? how far they go?

step-by-step explanation: