Suppose we want to choose 4 letters, without replacement, from 17 distinct letters. How many ways can this be done, if the order of the choices is not taken into consideration.

step-by-step explanation:

here's what happens:

1) the graph of f   = x^2 is shifted 2 units to the right.

2) the resulting graph is reflected in the x-axis, so that the parabola now opens down.

3) this final result is transformed up by 5 units.

they will manufacture 8496 cars

logv3(x+2)=1

rewrite in exponential form:

logb(x) = y is equal to b^y =x

b = 3, y = 1

now solve for x:

3^1 = x+2)

x = 3-2

x = 1

see the picture for the graph.

hiking down a winding trail.

step-by-step explanation: