Mark earned $1340 for a 40-hour week. Use the formula P = RH where (P is the pay,
1 answer:
You might be interested in
9514 1404 393
Answer:
a (3,-1)
Step-by-step explanation:
The number that "completes the square" is the square of half the x-coefficient, (-6/2)^2 = 9. Rearranging the given function to include the square trinomial, we have ...
f(x) = x^2 -6x +9 -1 . . . . . . . here, we have 8 = 9 - 1
f(x) = (x -3)^2 -1 . . . . . . . . . . vertex form
Comparing this to the generic vertex form ...
f(x) = (x -h)^2 +k . . . . . . . vertex at (h, k)
we see that h=3 and k=-1.
The vertex is (h, k) = (3, -1).
First let's find the number of the elements in the sample space, that is the total number of codes that can be produced.
The first digit is any of {0, 1, 2...,9}, that is 10 possibilities
the second digit is any of the remaining 9, after having picked one.
and so on...
so in total there are 10*9*8*7 = 5040 codes.
a. What is the probability that the lock code will begin with 5?
Lets fix the first number as 5. Then there are 9 possibilities for the second digit, 8 for the third on and 7 for the last digit.
Thus, there are 1*9*8*7=504 codes which start with 5.
so
P(first digit is five)=
b. <span>What is the probability that the lock code will not contain the number 0?
from the set {0, 1, 2...., } we exclude 0, and we are left with {1, 2, ...9}
from which we can form in total 9*8*7*6 codes which do not contain 0.
P(codes without 0)=n(codes without 0)/n(all codes)=(9*8*7*6)/(10*9*8*7)=6/10=0.6
Answer:
0.1 ; 0.6</span>
The first digit is any of {0, 1, 2...,9}, that is 10 possibilities
the second digit is any of the remaining 9, after having picked one.
and so on...
so in total there are 10*9*8*7 = 5040 codes.
a. What is the probability that the lock code will begin with 5?
Lets fix the first number as 5. Then there are 9 possibilities for the second digit, 8 for the third on and 7 for the last digit.
Thus, there are 1*9*8*7=504 codes which start with 5.
so
P(first digit is five)=
b. <span>What is the probability that the lock code will not contain the number 0?
from the set {0, 1, 2...., } we exclude 0, and we are left with {1, 2, ...9}
from which we can form in total 9*8*7*6 codes which do not contain 0.
P(codes without 0)=n(codes without 0)/n(all codes)=(9*8*7*6)/(10*9*8*7)=6/10=0.6
Answer:
0.1 ; 0.6</span>