Mathematics

Mathematics

Problem

Suppose a fixed point PP has coordinates (a,b)(a,b) with b>0b>0, and Q(x,y)Q(x,y) is a variable point restricted to lie on the xx-axis. The Euclidean distance from QQ to PP is D(x)=(x−a)2+b2.D(x)=\sqrt{(x-a)^2+b^2}. Answer the following questions about using D(x)D(x) versus D2(x)D^2(x) when seeking the location of QQ that is closest to PP. (a) Write an explicit expression for D2(x)D^2(x) and compute ddx[D2(x)]\dfrac{d}{dx}\bigl[D^2(x)\bigr]. Do not simplify the derivative. (b) Show algebraically that ddx[D(x)]=0\dfrac{d}{dx}\bigl[D(x)\bigr]=0 and ddx[D2(x)]=0\dfrac{d}{dx}\bigl[D^2(x)\bigr]=0 have exactly the same real solutions. (c) Explain, without further calculation, why minimizing D2(x)D^2(x) is sufficient for finding the value of xx that minimizes D(x)D(x) whenever D(x)>0D(x)>0. (d) Describe one practical advantage of working with D2(x)D^2(x) instead of D(x)D(x) in optimization problems of this type.
Intuitive explanation

This problem asks you to recognize a powerful optimization shortcut: minimizing distance is equivalent to minimizing squared distance, since the square root function is monotonically increasing. By working with D2(x)=(x−a)2+b2D^2(x) = (x-a)^2 + b^2 instead of D(x)D(x), you avoid messy calculus with square roots while finding the exact same minimizer—the key insight is that removing a monotonic wrapper doesn't change where the minimum occurs. This is a practical lesson in choosing the easiest path to the same answer.

Intuitive explanation

This problem asks you to recognize a powerful optimization shortcut: minimizing distance is equivalent to minimizing squared distance, since the square root function is monotonically increasing. By working with D2(x)=(x−a)2+b2D^2(x) = (x-a)^2 + b^2 instead of D(x)D(x), you avoid messy calculus with square roots while finding the exact same minimizer—the key insight is that removing a monotonic wrapper doesn't change where the minimum occurs. This is a practical lesson in choosing the easiest path to the same answer.

Browse the problem library