A certain oil refinery keeps intermediate products in 8 tanks. There are 15 pumps of varying capacity that can be assigned to pump the intermediate products from the 8 tanks into a final-product tank. Question: How many ways can you assign the 15 pumps to the 8 tanks so that each tank gets at least one pump?

Step-by-step explanation:

This question is permutation problem. permutations is the number of arrangements or orderings within a constant group.

The formula for permutation is given as

nPk = n!÷(n-k)!

Where n is the number of objects, k is the is the number of objects we want to chose from.

Solution to the question

15P8 = 15!÷(15-8)!

= 15!÷7!

= 15×14×13×12×11×10×9×8×7×6×5×4×3×2×1÷7×6×5×4×3×2×1

= 259459200

3

step-by-step explanation:

because where the point where the 2 lines intersect is (3,-1) the x value is 3