How many ways can four numbers be drawn from a group of ten numbers if the order does not matter?

210 ways

Step-by-step explanation:

Simply put in combinations and permutations,

ORDER MATTERS >> PERMUTATION

ORDER DOESNT MATTER >> COMBINATION

Formula for Permutation is  

Formula for Combination is  

These means taking r objects from a group of n

Also x! means x(x-1)(x-2)... (ex: 4! = 4 * 3 * 2 * 1)

Now, from the question, we have "order doesn't matter" so we have combination with n = 10 and r = 4.

Let's put the numbers into formula and find the

So, the answer is 210

answer

see attachment

explanation

the given function is

this function has y-intercept at

-4 and a slope of 2.

note that, the graph has a positive slope.

the graph that represents this function is the straight line that moves upward from left to right.

the graph touches the y-axis at -4.

the correct choice is the graph shown in the attachment.

for this pair of functions g(x)=x-2 and f(x)=|x| is (g o f)(a)= |a| -2

step-by-step explanation:

g(x)=x-2

f(x)=|x|

(g o f)(a)=?

(g o f)(x)=g(f(x))

(g o f)(x)=g(|x|)

(g o f)(x)=|x|-2

(g o f)(a)=|a|-2