Maximizing the Isoperimetric Problem with Integral Constraints | MathWorld

  • Thread starter Thread starter HACR
  • Start date Start date
HACR
Messages
35
Reaction score
0

Homework Statement


The isoperimetric problem is of the finding the object that has the largest area with the equal amount of perimeters; however, how does the integral constrained by the arc length get maximized? http://mathworld.wolfram.com/IsoperimetricProblem.html


Homework Equations





The Attempt at a Solution


...finding a point at which the integral is like finding the max and min of a function of two variables...
 
Physics news on Phys.org
HACR said:

Homework Statement


The isoperimetric problem is of the finding the object that has the largest area with the equal amount of perimeters; however, how does the integral constrained by the arc length get maximized? http://mathworld.wolfram.com/IsoperimetricProblem.html

The Attempt at a Solution


...finding a point at which the integral is like finding the max and min of a function of two variables...

The general subject is Calculus of Variations. One place to read about it is here:

http://www.google.com/url?sa=t&rct=...sg=AFQjCNGZoq3YfZweM8ZFKBWuB062RSvkZQ&cad=rja
 
It says the shortest path is the straight line; however, the brachistochrone problem proves that it is actually a curved line on which a stone could accelerate more. OK, brachistochrone problem is discussed. But why is on page 1163, the Euler Lagrangian equal to -\frac{u"}{(1+(u')^2)^{\frac{3}{2}}}? I got -u"+(u')^{2}u" for numerator.
 
Last edited:
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top