The Brachistochrone: Why the Fastest Descent Is a Cycloid

Grant Sanderson and Steven Strogatz explore Bernoulli’s light analogy and a geometric proof.

SSSteven Strogatz게스트
채널
3Blue1Brown
게시일
2016년 4월 1일
영상
16:01
읽기
2분
원문
영어
YouTube에서 열기
스크롤하면 영상이 오른쪽 아래로 작아져 계속 재생됩니다. 자막은 읽기 언어를 따릅니다.
읽기 언어2개 언어로 읽을 수 있음
이 글은 아직 한국어 번역이 없어 영어 원문으로 표시합니다.
요약

30초 요약

Grant Sanderson and Steven Strogatz discuss the fastest-descent problem, Bernoulli’s connection to refraction and a geometric argument for the cycloid. The idealized setup assumes a frictionless particle starting at rest.

  1. 1Fastest versus shortestA steeper start can gain speed at the cost of distance.
  2. 2HistoryBernoulli posed the problem as a challenge in 1696.
  3. 3Light analogyThe solution uses a connection to light traveling through varying speeds.
  4. 4EnergySpeed grows with the square root of vertical drop in the idealized setup.
  5. 5CycloidThe minimizing path is a cycloid.
  6. 6GeometryA geometric construction shows the cycloid satisfies the required relation.
  7. 7A challengeThe closing challenge re-expresses motion using angle and time.

핵심 정리

  1. A steeper start can gain speed at the cost of distance.
  2. Bernoulli posed the problem as a challenge in 1696.
  3. The solution uses a connection to light traveling through varying speeds.
  4. Speed grows with the square root of vertical drop in the idealized setup.
  5. The minimizing path is a cycloid.
  6. A geometric construction shows the cycloid satisfies the required relation.
  7. The closing challenge re-expresses motion using angle and time.
전문

챕터별로 다듬은 전문 읽기

원본 자막만 보기
01

Fastest descent

History, refraction, geometry and a further challenge.

Grant Sanderson talks with mathematician Steven Strogatz about the brachistochrone: the curve of fastest descent between two points under gravity. In the standard setup, the particle starts at rest and slides without friction in a uniform gravitational field.

The shortest path is not necessarily the fastest. A steeper initial descent gains speed sooner, but adds distance; the problem asks for the best balance.

Strogatz recounts Galileo’s interest in the question and Johann Bernoulli’s 1696 challenge. They tell a well-known story about Newton’s anonymous solution while acknowledging that part of the anecdote is legendary.

Bernoulli’s insight relates a sliding particle to light passing through layers in which speed changes. Fermat’s principle and Snell’s law provide a way to express the time-minimizing path.

Conservation of energy gives speed proportional to the square root of vertical drop. In the layered-light analogy, the ratio of the sine of the tangent’s angle to the vertical to that square root remains constant along the limiting path.

The resulting curve is a cycloid, traced by a point on the rim of a rolling circle. Sanderson then presents a geometric argument attributed to mathematician Mark Levi for why the cycloid has the required property.

The wheel’s contact point is the instantaneous center of rotation. Using perpendicular tangents and similar triangles, the construction relates the drop to the sine of the tangent angle and shows the required ratio is constant.

Sanderson ends with a further challenge: describe the sliding motion using the tangent angle as a function of time. For this idealized motion on a cycloid, the associated wheel angle changes at a constant rate, suggesting a different way to look for a proof.

같은 채널의 다른 글

슬라이드 20장40:44EN
3Blue1Brown· 2026년 10월 16일Grant Sanderson: There's never been a better time to go into mathGrant Sanderson, Constantin Kogler · 3Blue1BrownStudents fear AI has solved mathematics. Grant Sanderson argues the opposite: even if machines prove theorems better than we do, the institution of math stays valuable—and this is a rare moment when newcomers can reshape it.MathematicsAI for scienceHuman-AI Collaboration+2
슬라이드 29장51:55EN
3Blue1Brown· 2026년 9월 18일The last IMO problem AI could not solveGrant Sanderson · 3Blue1BrownGrant Sanderson walks through IMO 2025 Problem 6 — a tiling puzzle that frontier models missed — and the visual patience it takes to prove a construction is optimal.MathematicsAI researchReasoning & test-time compute+2
0:55EN
3Blue1Brown· 2026년 7월 24일The 64 Sugar Cubes Puzzle: Six Equal DistancesA 4×4×4 block has three colors; prove that six same-colored pairs share a distance.MathematicsEducation
33:51EN
3Blue1Brown· 2026년 7월 16일What Cross-Entropy Connects: Compression, Language Models and KL DivergenceGrant Sanderson · 3Blue1BrownGrant Sanderson builds cross-entropy from code lengths and uses it to explain next-token training and distillation.MathematicsMachine LearningFoundation Models+1
슬라이드2:25EN
3Blue1Brown· 2026년 6월 12일How Shannon Measured the Entropy of EnglishA guessing game helped Claude Shannon estimate how much information English text contains, and why prediction is central to compression.MathematicsAI History
슬라이드1:02EN
3Blue1Brown· 2026년 6월 10일A Robot Walk and the Puzzle of Optimal Binary EncodingHow few bits does it take to send directions that occur with unequal frequencies?MathematicsScience Communication