Answer:
6 ways
Step-by-step explanation:
The total number of people we have entering Kennywood is 6, since it’s Jim with 5 of his friends.
Now, we can only have movement through the game one at a time
The number of ways they can move through the gate one at a time is 6C1 ways
and that is mathematically;
if we are to select a number of r items from a total of n, the number of combinations or ways is;
nCr = n!/(n-r)!r!
Applying these to the problem at hand, we have
6!/(6-1)!1! = 6!/(5!)(1!) = (6 * 5!)/5! = 6 ways
Answer:
z=16
Step-by-step explanation:
z/4-2=2(take l.c.m)
or,(z-8)/4=2
or,z-8=8
z=16
Answer:
Graph B
This is because of the vertical line test. Say you were to draw a vertical line that stretches through the whole graph. If this line you draw passes through more than two points of the same line/function/whatever b is, it is not a function.
Answer: 22-4x when you simplify it all.
Answer:
Latoya's statement because they are similar not congruent
