Ask your own question, for FREE!
Mathematics 20 Online
OpenStudy (anonymous):

Need help! (Calculus - Optimisation) Two towns, Ancaster and Dundas, are 4 km and 6 km, respectively, from an old railroad line that has been made into a bike trail. Points C and D on the trail are the closest points to the two towns, respectively. These points are 8 km apart. Where should a rest stop be built to minimise the length of the new trail that must be built from both towns to the rest stop? (Medals shall be awarded)

OpenStudy (anonymous):

|dw:1365556619877:dw|

OpenStudy (anonymous):

that is how i read the problem the square of the distance between A and x is \[x^2+16\] and the square of the distance between D and x is \[(8-x)^2+36\] minimize \[x^2+16+(58-x)^2+36\]

OpenStudy (anonymous):

i mean minimize \[x^2+16+(8-x)^2+36\]

OpenStudy (anonymous):

I see, thank you very much satellite :)

OpenStudy (anonymous):

yw

OpenStudy (anonymous):

btw you do not need calculus for this

OpenStudy (anonymous):

\[x^2+16+(8-x)^2+36=2 x^2-16 x+116\] a quadratic minimum is at the vertex, which you can find via \(-\frac{b}{2a}=-\frac{-16}{4}=4\)

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!