Answer:
5,7,3,2
Step-by-step explanation:
It's pretty simple: a prime number is a number that can *only* be divided by the number 1 and it's own.
I just checked all the numbers from 1 to 10 in order to solve this problem.
If you have any questions about the way I solved it, don't hesitate to ask!
Answer:
(3, 0).
Step-by-step explanation:
dentifying the vertices of the feasible region. Graphing is often a good way to do it, or you can solve the equations pairwise to identify the x- and y-values that are at the limits of the region.
In the attached graph, the solution spaces of the last two constraints are shown in red and blue, and their overlap is shown in purple. Hence the vertices of the feasible region are the vertices of the purple area: (0, 0), (0, 1), (1.5, 1.5), and (3, 0).
The signs of the variables in the contraint function (+ for x, - for y) tell you that to maximize C, you want to make y as small as possible, while making x as large as possible at the same time.
Hence, The Answer is ( 3, 0)
Answer:
The answer is 13
Step-by-step explanation:
Hope this helps :)
Lets remember the property "alternative-interior angles" when we have parallels lines:
Given two paralles lines, the following is true:
In our question, we have:
We know that the angles J + P + K=180
So, the triangles have all the angles the same, so they are similar by angle-angle-angle, and they have one side congruent, AC=CD, so the triangles are congruents.