Notice that

so the constraint is a set of two lines,

and only the first line passes through the first quadrant.
The distance between any point
in the plane is
, but we know that
and
share the same critical points, so we need only worry about minimizing
. The Lagrangian for this problem is then

with partial derivatives (set equal to 0)



We have

which tells us that

so that
is a critical point. The Hessian for the target function
is

which is positive definite for all
, so the critical point is the site of a minimum. The minimum distance itself (which we don't seem to care about for this problem, but we might as well state it) is
.
Answer:
B
Step-by-step explanation:
Well first you got to add up of the sides
Answer:
Solutions:


Step-by-step explanation:

Expanding the factored form:


Factoring the second-degree polynomial:

This is true for
