Answer:

Step-by-step explanation:
To solve, first subtract 2x from both sides.

You appear to want the solution for -y, so I've included it. Given that you also want the solution for y, divide both sides by -1.

Answer:
Step-by-step explanation:
From the given triangles in the picture attached,
∠A ≅ ∠X [Given]
∠B ≅ ∠Y [Given]
By AA property of similarity of the triangles, both the triangles will be similar.
ΔABC ~ ΔXZY
Similarity statement:
Corresponding sides of these similar triangles will be proportional.

Similarity ratio:

= 
= 3 : 2
Answer:
Following are the solution to the given equation:
Step-by-step explanation:
The graph file and correct question are defined in the attachment please find it.
According to the linear programming principle, we predict, that towards the intersections of the constraint points in the viability area, and its optimal solution exists. The sketch shows the points that are (0,16), (3,1), and (6,0).
by putting each point value into the objective function:
Thus, the objective of the function is reduced with a value of 183 at (3,1).
Answer:
There are ten possible digits (0 to 9).
If they can be repeated, you're looking at 10 * 10 *10 * 10 * 10, or 105
This means 100000 possible zip codes if repeatable.
If not, you're looking at one less each time:
10 * 9 * 8 * 7 * 6
90 * 56 * 6
540 * 56 = 30240 zip codes without any repetitions.
Answer:
$10.71
Step-by-step explanation:
7.14 / 42 = 0.17 / per LB
0.17 * 63 = $10.71