Euler Equation to Compute Extreme?

  • Context: Undergrad 
  • Thread starter Thread starter black_hole
  • Start date Start date
  • Tags Tags
    Euler
Click For Summary

Discussion Overview

The discussion revolves around a homework problem related to the Euler equation and its application in computing extrema, specifically in the context of determining the shortest path between two points using calculus of variations. The scope includes theoretical aspects of calculus and mathematical reasoning.

Discussion Character

  • Homework-related, Mathematical reasoning

Main Points Raised

  • A participant presents a homework problem involving the Euler equation and seeks clarification on its application to compute extrema related to the length of a graph.
  • Another participant suggests that the problem pertains to the Euler-Lagrange equation from the calculus of variations, which is relevant for solving such problems.
  • A participant expresses gratitude for the clarification provided regarding the Euler equation.

Areas of Agreement / Disagreement

Participants generally agree on the relevance of the Euler-Lagrange equation to the problem, but there is no consensus on the specific interpretation of the homework prompt.

Contextual Notes

The discussion does not resolve the ambiguity in the homework prompt or the specific formula being referenced. There may be assumptions about familiarity with calculus of variations that are not explicitly stated.

black_hole
Messages
71
Reaction score
0
A problem on my homework:

We learn early on that "the shortest distance between two points is a straight line." Let's prove it...Using the Euler equation, compute the extrema of

∫sqrt(1 + (dy/dx)2)dx from x1 to x2 ...show that this corresponds to lines "y = mx +b".

Euler had a lot of different equations. I recognize this as the formula for calculating the length of a graph but that's not what I'm being asked to do. Does anyone what formula this is referring to?

Thanks!
 
Physics news on Phys.org
If the hint is confusing, then ignore it for the moment. Amongst all paths from one point to another, how would you go about determining which ones have the shortest length?
 
Thanks HallsofIvy. That was exactly what I was looking for!
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 13 ·
Replies
13
Views
1K
  • · Replies 15 ·
Replies
15
Views
7K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 6 ·
Replies
6
Views
1K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 233 ·
8
Replies
233
Views
24K
  • · Replies 3 ·
Replies
3
Views
2K