Please give me the correct answer.Only answer if you're very good at math.Please don't put a link to a website.
1 answer:
Answer:
3, 50, 2
Step-by-step explanation:
By multiplying all terms by 5, we are trying to remove the fraction on the left hand side. On the right hand side of the equation, expand the bracket by multiplying 5 to each term in the bracket.
3(n +25)= 5(10) +5()
3(n +25)= 50 +2n
To find the value of n, expand the bracket on the left hand side:
3(n) +3(25)= 50 +2n
3n +75= 50 +2n
Bring all n terms to one side, constants to the other:
3n -2n= 50 -75
n= -25
You might be interested in
Answer:
Length (parallel to the x-axis): ;
Height (parallel to the y-axis): .
Step-by-step explanation:
Let the top-right vertice of this rectangle .
. The opposite vertice will be at
. The length the rectangle will be
while its height will be
.
Function that needs to be maximized: .
The rectangle is inscribed in the ellipse. As a result, all its vertices shall be on the ellipse. In other words, they should satisfy the equation for the ellipse. Hence that equation will be the equation for the constraint on x and y.
For Lagrange's Multipliers to work, the constraint shall be in the form: . In this case
.
Start by finding the first derivatives of and
with respect to x and y, respectively:
,
.
,
.
This method asks for a non-zero constant, , to satisfy the equations:
, and
.
(Note that this method still applies even if there are more than two variables.)
That's two equations for three variables. Don't panic. The constraint itself acts as the third equation of this system:
.
.
Replace the in equation
with the right-hand side of equation
.
.
Before dividing both sides by , make sure whether
.
If , the area of the rectangle will equal to zero. That's likely not a solution.
If , divide both sides by
,
. Hence by equation
,
. Replace the
in equation
with this expression to obtain (given that
)
. Hence
. The length of the rectangle will be
while the height will be
. If there's more than one possible solutions, evaluate the function that needs to be maximized at each point. Choose the point that gives the maximum value.