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
.
Step-by-step explanation:

Given equaiton is in the form of ax^2 +bx+c=0
we apply quadratic formula to solve for x

a= 1 b = -12 and c= 59



Divide the 12 and square root terms by 2

so
and 
The numbers start from the top
Answer:
p=7x
Step-by-step explanation:
49x^[2] + 28x - 10 = p^[2] + 4p -10
This equation is in the form a^[2]x + bx + c.
<u><em>The 'c' is common for both equations, this means the 'a' and 'b' must also be common. </em></u>
There are two ways to find p: 'a' or 'b'
<u>a method</u>
49x^[2] = p^[2]
=> The square root of both sides = 7x = p
<u>b method</u>
28x = 4p
28x/4 = 4p/4
7x = p