Apply the Pyth. Theorem:
c^2 = 3^2 + 7^2, or c^2 = 9 + 49 = 58. Thus, c = sqrt(58).
Answer:
x=2 and y=1
Step-by-step explanation:
Rewrite equations:
y=−x+3;y=x−1
Step: Solve
y=−x+3
Step: Substitute−x+3foryiny=x−1:
y=x−1
−x+3=x−1
−x+3+−x=x−1+−x(Add -x to both sides)
−2x+3=−1
−2x+3+−3=−1+−3(Add -3 to both sides)
−2x=−4−2x−2=−4−2
(Divide both sides by -2)
x=2
Step: Substitute2forxiny=−x+3:
y=−x+3
y=−2+3
y=1(Simplify both sides of the equation)
Hope this Helps you :)
Answer:
195 rupees
Step-by-step explanation:
10kg=325 rupees
6kg=?
Cross multiplication;
=6×325/10
=1950/10
=195 rupees
Answer:
The additive inverse of the polynomial being subtracted is -0.612-8+181
Step-by-step explanation:
Given expression : (1.32 +0.412 – 241) – (0.612 + 8 - 181)
Now the polynomial being subtracted : (0.612 + 8 - 181)
Additive inverse : The number in the set of real numbers that when added to a given number will give zero.
So, Additive inverse of 0.612 = -0.612
Additive inverse of 8 = -8
Additive inverse of -181 = 181
So, The additive inverse of polynomial being subtracted : -0.612-8+181
So, Option B is true
Hence the additive inverse of the polynomial being subtracted is -0.612-8+181
Well, I'm not completely sure, because I don't know the formal definition
of "corner" in this work. It may not be how I picture a 'corner'.
Here's what I can tell you about the choices:
A). (0, 8)
This is definitely a corner of the feasible region.
It's the point where the first and third constraints cross.
So it's not the answer.
B). (3.5, 0)
This is ON the boundary line between the feasible and non-feasible
regions. But it's not a point where two of the constraints cross, so
to me, it's not what I would call a 'corner'.
C). (8, 0)
Definitely not a corner, no matter how you define a 'corner'.
This point is deep inside the non-feasible zone, and it doesn't
touch any point in the feasible zone.
So tome, this looks like probably the best answer.
D). (5, 3)
This is definitely a corner. It's the point of intersection (the solution)
of the two equations that are the first two constraints.
The feasible region is a triangle.
The three vertices of the triangle are (0,8) (choice-A),
(0,-7) (not a choice), and (5,3) (choice-D) .
region is a triangle
