A salesperson works 40 hours per week at a job where he has two options for being paid. Option A is an hourly wage of $. Option
1 answer:
You might be interested in
Answer:
1) a) 0.8
b) 0.6
2) a) 0.08
b) 0.14
Step-by-step explanation:
1) Given
and
Let us learn about a formula:
(a) If A and B are mutually exclusive i.e. no common thing in the two events.
In other words:
=
= 0
Using above formula:
(b) P(A and B) = 0.2
Using above formula:
*************************************
1) Given
and
Let us learn about a formula:
for dependent events
for independent events.
(a) If A and B are independent events :
Using the above formula for independent events:
(b)
Using above formula:
Answer:
Step-by-step explanation:
Use the formula for the area of a triangle,
Area of a triangle =
7). Area of the triangle =
= 74 km²
8). Area of the triangle =
= 30.8 cm²
9). Area of the triangle =
= 56 m²
10). Area of the triangle =
= 42.35 km²
Answer:
a.
b. x = -8 and y = 4
Step-by-step explanation:
This question is incomplete. I will type the complete question below before giving my solution.
For integers a, b, c, consider the linear Diophantine equation
Suppose integers x0 and yo satisfy the equation; that is,
what other values
and
also satisfy ax + by = c? Formulate a conjecture that answers this question.
Devise some numerical examples to ground your exploration. For example, 6(-3) + 15*2 = 12.
Can you find other integers x and y such that 6x + 15y = 12?
How many other pairs of integers x and y can you find ?
Can you find infinitely many other solutions?
From the Extended Euclidean Algorithm, given any integers a and b, integers s and t can be found such that
the numbers s and t are not unique, but you only need one pair. Once s and t are found, since we are assuming that gcd(a,b) divides c, there exists an integer k such that gcd(a,b)k = c.
Multiplying as + bt = gcd(a,b) through by k you get
So this gives one solution, with x = sk and y = tk.
Now assuming that ax1 + by1 = c is a solution, and ax + by = c is some other solution. Taking the difference between the two, we get
Therefore,
This means that a divides b(y−y1), and therefore a/gcd(a,b) divides y−y1. Hence,
for some integer r. Substituting into the equation
or
Thus if ax1 + by1 = c is any solution, then all solutions are of the form
In order to find all integer solutions to 6x + 15y = 12
we first use the Euclidean algorithm to find gcd(15,6); the parenthetical equation is how we will use this equality after we complete the computation.
Therefore gcd(6,15) = 3. Since 3|12, the equation has integral solutions.
We then find a way of representing 3 as a linear combination of 6 and 15, using the Euclidean algorithm computation and the equalities, we have,
Because 4 multiplies 3 to give 12, we multiply by 4
So one solution is
&
All other solutions will have the form
where ∈ Ζ
Hence by putting r values, we get many (x, y)