Answer:
1/6
Step-by-step explanation:
The number of ways they can line up is 3×2×1 = 6. Only one of these is alphabetical order. The probability that they will line up randomly in alphabetical order is 1/6.
__
Any of the three can line up first; either of the remaining two can line up second, and the remaining person can line up last. Thus there are 3×2×1 possible orders.
Answer:
There are no solutions
Step-by-step explanation:
Because the lines are parallel, they will never meet, meaning there are no solutions to this system of equations
Answer:
D
Step-by-step explanation:
you can just find the value of y and try some number of x
i.e. if x = 0, both of them will be 0
x = 1
G(x) result is -2
F(x) result is 1
x= -1
G(x) result will be 2
F(x) result is -1
so from these we can prove that G(x) is bigger graph than F(x) but flip vertically by y axis
Answer:
0.4
Step-by-step explanation:
Let X be the random variable that represents the number of consecutive days in which the parking lot is occupied before it is unoccupied. Then the variable X is a geometric random variable with probability of success p = 2/3, with probability function f (x) = [(2/3)^x] (1/3)
Then the probability of finding him unoccupied after the nine days he has been found unoccupied is:
P (X> = 10 | X> = 9) = P (X> = 10) / P (X> = 9). For a geometric aeatory variable:
P (X> = 10) = 1 - P (X <10) = 0.00002
P (X> = 9) = 1 - P (X <9) = 0.00005
Thus, P (X> = 10 | X> = 9) = P (X> = 10) / P (X> = 9) = 0.00002 / 0.00005 = 0.4.
Answer:10
Step-by-step explanation: divide 60 by 6
