[Grade 12 Math] Optimization?
-
Sum of areas of two squares is unity, if they can be packed, without overlapping, inside a rectangle, then the least value of area of the rectangle is?
-
Find the least distance from (0, -1) that can be traveled to reach ((sqrt(5)+2)/sqrt(5), (sqrt(5)+1)/sqrt(5)) without entering y^2 < x
x^2 + y^2 = 1, but I can't figure out how to pack them unless they're the same size
For the second one don't know where to begin since I can't even properly figure out where the point is
Posted Oct 30, 2017, 6:53 PM UTC
28
For the first, there is no requirement that the rectangle have no leftover space once the squares are inside. In fact, the question is asking you to define the scenario with the least leftover space. If the squares are the same size, then that becomes zero, but try to define it for any two squares.
For the second, if you have a graphing calculator (or Desmos), try plotting the two points and the inequality. This should give you a visual indication of the correct path.
Hey can I guess the ans to the second problem? It should be a curve defined piecewise, that is given by the two tangents of the parabola going through the mentioned points and the rest part of the curve is the segment parabola itself between the points where the tangents touch the parabola, right? But how to prove that using 12th grade calculus?
Luckily, the question doesn't ask for proof, but you are spot on in your analysis of the curve. Also, one of the tangent lines is super easy to find.
Haha right. It doesn’t ask for proof. I’m still curious though. I’ve been staring at it since the questions were posted. And thanks for confirming the guess.
One method i can imagine is to consider a stretched rubber band tethered at the two points and a solid wall along the parabola. But it sounds rather wacky.
x^2 + y^2 = 1
If I consider two random sized squares next to each other, then the area of the rectangle they form would be x(x+y)
-x^2 + 1 - x^2 = -2x sqrt(1 - x^2 )
4x^4 - 4x^2 + 1 = 4x^2 - 4x^4
8x^4 - 8x^2 + 1 = 0
Solving that gives a really weird result, can you check?
We essentially have two cases in this problem. The first is the trivial case, when x=y and the area of the rectangle is 2x^(2)=1. The second case is when x!=y, and you have chosen to assign x>y. I'm with you up to this point, where you say the area of the rectangle is A=x(x+y). You can make a substitution to put everything in terms of x or y, but you cannot solve the equation for numerical values without another piece of information. You will have A in terms of x or y. From there you can use the fact that x>y to show this leads to A>1.
EDIT - I didn't realize you were using calculus. Once I get home I can write up a better explanation.
I set dA/dx = 0
If you calculate the derivative dA/dx, it gets pretty messy, but you really don't need to. Check out a graph of the situation. When you set the derivative equal to zero in this particular case, you are finding the point of maximum area. Your question asks you to minimize the area. Given the constraint that the respective areas of the squares sum to unity, there are two points on the graph that satisfy this requirement. One is at x=sqrt(1/2) and one is at x=1. If x=1, then y=0, so the answer you are interested in is the former. To show this on paper, you would calculate d^(2)A/dx^(2) at the point where dA/dx is zero, and because the second derivative is negative at that point you would know A(x) is concave down there and thus it is a maximum. From there you are left to evaluate the function at the endpoints of the legal domain.