MHB Find the Length of Shortest Ladder to Reach Over 8 ft. Fence

  • Thread starter Thread starter MarkFL
  • Start date Start date
AI Thread Summary
To find the shortest ladder length needed to reach over an 8 ft fence located 15 ft from a building, the problem can be modeled using optimization techniques. By minimizing the sum of the squares of the intercepts of a line passing through the point (15, 8), the objective function is defined as f(a, b) = a² + b². Using Lagrange multipliers, the relationship between the intercepts leads to the expressions for a and b in terms of the given dimensions. Substituting the values of d and h into the derived formula results in a minimum ladder length of approximately 32.01 ft. This calculation provides the optimal solution for the ladder's length to clear the fence.
MarkFL
Gold Member
MHB
Messages
13,284
Reaction score
12
Here is the question:

A fence 8 ft. high (h) runs parallel to a building and is 15 feet (d) from it. Find the length (L) of the shortest ladder that will reach..?

A fence 8 ft. high (h) runs parallel to a building and is 15 feet (d) from it. Find the length (L) of the shortest ladder that will reach from the ground across the top of the fence and to the wall of the building.

I have posted a link there to this thread so the OP can view my work.
 
Mathematics news on Phys.org
Hello Hi,

If we ignore all dimensions of the ladder except the length, this is equivalent to minimizing the sum of the squares of the intercepts of a line passing through the point $(d,h)$ in the first quadrant of the $xy$-plane. Let $a$ and $b$ be the $x$-intercept and $y$-intercept respectively if this line. Thus, the function we wish to minimize is (the objective function):

$f(a,b)=a^2+b^2$

Now, using the two-intercept form for a line, we find we must have (the constraint):

$\displaystyle \frac{d}{a}+\frac{h}{b}=1$

Using Lagrange multipliers, we find:

$\displaystyle 2a=\lambda\left(-\frac{d}{a^2} \right)$

$\displaystyle 2b=\lambda\left(-\frac{h}{b^2} \right)$

and this implies:

$\displaystyle b=a\left(\frac{h}{d} \right)^{\frac{1}{3}}$

Substituting for $b$ into the constraint, there results:

$\displaystyle \frac{d}{a}+\frac{h}{a\left(\frac{h}{d} \right)^{\frac{1}{3}}}=1$

$\displaystyle a=d^{\frac{1}{3}}\left(d^{\frac{2}{3}}+h^{\frac{2}{3}} \right)$

Hence, we have:

$\displaystyle b=h^{\frac{1}{3}}\left(d^{\frac{2}{3}}+h^{\frac{2}{3}} \right)$

and so we find:

$\displaystyle f_{\min}=f\left(d^{\frac{1}{3}}\left(d^{\frac{2}{3}}+h^{\frac{2}{3}} \right),h^{\frac{1}{3}}\left(d^{\frac{2}{3}}+h^{ \frac{2}{3}} \right) \right)=\left(d^{\frac{2}{3}}+h^{\frac{2}{3}} \right)^3$

Now, we need to take the square root of this since the objective function is the square of the distance we actually wish to minimize. Let $L$ be the length of the ladder, and we now have:

$\displaystyle L_{\min}=\left(d^{\frac{2}{3}}+h^{\frac{2}{3}} \right)^{\frac{3}{2}}$

Letting $d=15\text{ ft}$ and $h=8\text{ ft}$ we have:

$\displaystyle L_{\min}=\left(15^{\frac{2}{3}}+8^{\frac{2}{3}} \right)^{\frac{3}{2}}\text{ ft}\approx32.0134951101408\text{ ft}$
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Back
Top