Problem

shows a bead sliding down a frictionless wire from point P to point Q. The brachistochrone...

shows a bead sliding down a frictionless wire from point P to point Q. The brachistochrone problem asks what shape the wire should be in order to minimize the bead’s time of descent from P to Q. In June of 1696, John Bernoulli proposed this problem as a public challenge, with a 6-month deadline (later extended to Easter 1697 at George Leibniz’s request). Isaac Newton, then retired from academic life and serving as Warden of the Mint in London, received Bernoulli’s challenge on January 29, 1697. The very next day he communicated his own solutionof the tangent line to the curve–the curve of minimal descent time is an are of an inverted cycloid–to the Royal Society of London. For a modern derivation of this result, suppose the bead starts from rest at the origin P and let y = y(x) be the equation of the desired curve in a coordinate system with the y − axis pointing downward. Then a mechanical analogue of Snell’s law in optics implies that

where α denotes the angle of deflection (from the vertical) of the tangent line to the curve–so cotα = y′(x) (why?)–and is the bead’s velocity when it has descended a distance y vertically (from KE = ½mv2 = mgy = −PE).

FIGURE. A bead sliding down a wire-the brachistochrone problem.

(a) First derive from Eq. (i) the differential equation

where a is an appropriate positive constant.


(b) Substitute y = 2a sin2 t, dy = 4a sin t cos t dt in (ii) to derive the solution

x = a(2t − sin 2t), y = a (1 − cos 2t) (iii)

for which t = y = 0 when x = 0. Finally, the substitution of θ = 2a in (iii) yields the standard parametric equations x = a(θ − sinθ), y = a(1 − costθ) of the cycloid that is generated by a point on the rim of a circular wheel of radius a as it rolls along the x-axis. [See Example 5 in Section 9.4 of Edwards and Penney, Calculus: Early Transcendentals, 7th edition (Upper Saddle River, NJ: Prentice Hall, 2008).]

Step-by-Step Solution

Request Professional Solution

Request Solution!

We need at least 10 more requests to produce the solution.

0 / 10 have requested this problem solution

The more requests, the faster the answer.

Request! (Login Required)


All students who have requested the solution will be notified once they are available.
Add your Solution
Textbook Solutions and Answers Search