SlideShare una empresa de Scribd logo
1 de 39
Descargar para leer sin conexión
Section 5.1
                   Areas and Distances

                           Math 1a


                      December 5, 2007


Announcements
   my next office hours: Today 1–3 (SC 323)
   MT II is nearly graded. You’ll get it back Friday
   Final seview sessions: Wed 1/9 and Thu 1/10 in Hall D, Sun
   1/13 in Hall C, all 7–8:30pm
   Final tentatively scheduled for January 17
Outline



   Archimedes


   Cavalieri


   Generalizing Cavalieri’s method


   Worksheet
Meet the mathematician: Archimedes




     287 BC – 212 BC (after
     Euclid)
     Geometer
     Weapons engineer
Archimedes found areas of a sequence of triangles inscribed in a
parabola.

                A=
1




Archimedes found areas of a sequence of triangles inscribed in a
parabola.

                A=1
1
                    1                        1
                    8                        8




Archimedes found areas of a sequence of triangles inscribed in a
parabola.
                            1
                A=1+2·
                            8
1                                      1
             64                                     64
                                  1
                    1                           1
                    8                           8

                          1            1
                          64           64



Archimedes found areas of a sequence of triangles inscribed in a
parabola.
                               1     1
                  A=1+2·         +4·    + ···
                               8     64
1                                     1
             64                                    64
                                1
                    1                        1
                    8                        8

                          1           1
                          64          64



Archimedes found areas of a sequence of triangles inscribed in a
parabola.
                        1      1
                  A=1+2·  +4·     + ···
                        8     64
                      1   1          1
                            + ··· + n + ···
                   =1+ +
                      4 16          4
We would then need to know the value of the series
                       1   1         1
                             + ··· + n + ···
                  1+     +
                       4 16         4
But for any number r and any positive integer n,

              (1 − x)(1 + r + · · · + r n ) = 1 − r n+1

So
                                         1 − r n+1
                  1 + r + · · · + rn =
                                           1−r
Therefore
                              1 − (1/4)n+1
            1   1         1                  1  4
                  + ··· + n =              →3 =
       1+     +
                                 1 − 1/4
            4 16         4                   /4 3
as n → ∞.
Outline



   Archimedes


   Cavalieri


   Generalizing Cavalieri’s method


   Worksheet
Cavalieri




      Italian,
      1598–1647
      Revisited
      the area
      problem
      with a
      different
      perspective
Cavalieri’s method


                     Divide up the interval into
                     pieces and measure the area
                     of the inscribed rectangles:
Cavalieri’s method


                     Divide up the interval into
                     pieces and measure the area
                     of the inscribed rectangles:
                            1
                     L2 =
                            8
Cavalieri’s method


                     Divide up the interval into
                     pieces and measure the area
                     of the inscribed rectangles:
                            1
                     L2 =
                            8
                     L3 =
Cavalieri’s method


                     Divide up the interval into
                     pieces and measure the area
                     of the inscribed rectangles:
                          1
                     L2 =
                          8
                          1   4   5
                     L3 =   +   =
                          27 27   27
Cavalieri’s method


                     Divide up the interval into
                     pieces and measure the area
                     of the inscribed rectangles:
                          1
                     L2 =
                          8
                          1   4   5
                     L3 =   +   =
                          27 27   27
                     L4 =
Cavalieri’s method


                     Divide up the interval into
                     pieces and measure the area
                     of the inscribed rectangles:
                          1
                     L2 =
                          8
                          1   4   5
                     L3 =   +   =
                          27 27   27
                          1   4   9    14
                     L4 =   +   +    =
                          64 64 64     64
Cavalieri’s method


                     Divide up the interval into
                     pieces and measure the area
                     of the inscribed rectangles:
                          1
                     L2 =
                          8
                          1   4   5
                     L3 =   +   =
                          27 27   27
                          1   4   9    14
                     L4 =   +   +    =
                          64 64 64     64
                     L5 =
Cavalieri’s method


                     Divide up the interval into
                     pieces and measure the area
                     of the inscribed rectangles:
                          1
                     L2 =
                          8
                          1     4     5
                     L3 =    +     =
                          27 27      27
                          1     4    9    14
                     L4 =    +     +    =
                          64 64 64        64
                           1      4     9    16   30
                     L5 =     +      +     +    =
                          125 125 125 25          125
Cavalieri’s method


                     Divide up the interval into
                     pieces and measure the area
                     of the inscribed rectangles:
                            1
                     L2 =
                            8
                             1    4     5
                     L3   =    +     =
                            27 27      27
                             1    4    9    14
                     L4   =    +     +    =
                            64 64 64        64
                             1      4     9    16   30
                     L5   =     +      +     +    =
                            125 125 125 25          125
                     Ln   =?
What is Ln ?
                                                                   1
   Divide the interval [0, 1] into n pieces. Then each has width     .
                                                                   n
What is Ln ?
                                                                1
   Divide the interval [0, 1] into n pieces. Then each has width .
                                                                n
   The rectangle over the ith interval and under the parabola has area
                                    2
                                            (i − 1)2
                             i −1
                       1
                         ·              =            .
                                               n3
                       n       n
What is Ln ?
                                                                1
   Divide the interval [0, 1] into n pieces. Then each has width .
                                                                n
   The rectangle over the ith interval and under the parabola has area
                                    2
                                            (i − 1)2
                             i −1
                       1
                         ·              =            .
                                               n3
                       n       n

   So
              22         (n − 1)2   1 + 22 + 32 + · · · + (n − 1)2
           1
             + 3 + ··· +
    Ln =                          =
           n3 n             n3                   n3
What is Ln ?
                                                                1
   Divide the interval [0, 1] into n pieces. Then each has width .
                                                                n
   The rectangle over the ith interval and under the parabola has area
                                      2
                                              (i − 1)2
                               i −1
                        1
                          ·               =            .
                                                 n3
                        n        n

   So
              22         (n − 1)2   1 + 22 + 32 + · · · + (n − 1)2
           1
             + 3 + ··· +
    Ln =                          =
           n3 n             n3                   n3
   The Arabs knew that
                                                 n(n − 1)(2n − 1)
            1 + 22 + 32 + · · · + (n − 1)2 =
                                                        6
   So
                              n(n − 1)(2n − 1)
                      Ln =
                                    6n3
What is Ln ?
                                                                1
   Divide the interval [0, 1] into n pieces. Then each has width .
                                                                n
   The rectangle over the ith interval and under the parabola has area
                                     2
                                             (i − 1)2
                              i −1
                        1
                          ·              =            .
                                                n3
                        n       n

   So
              22         (n − 1)2   1 + 22 + 32 + · · · + (n − 1)2
           1
             + 3 + ··· +
    Ln =                          =
           n3 n             n3                   n3
   The Arabs knew that
                                                n(n − 1)(2n − 1)
            1 + 22 + 32 + · · · + (n − 1)2 =
                                                       6
   So
                              n(n − 1)(2n − 1)   1
                                               →
                      Ln =             3
                                    6n           3
   as n → ∞.
Cavalieri’s method for different functions
   Try the same trick with f (x) = x 3 . We have

                                                            n−1
                 1      1       1      2             1
                   ·f             ·f       + ··· +     ·f
          Ln =              +
                 n      n       n      n             n       n
Cavalieri’s method for different functions
   Try the same trick with f (x) = x 3 . We have

                                                   n−1
              1    1   1     2          1
                ·f   + ·f       + ··· + · f
          Ln =
              n    n   n     n          n           n
                        3       1 (n − 1)3
              11     12
             = · 3 + · 3 + ··· + ·
                                      n3
              nn     nn         n
Cavalieri’s method for different functions
   Try the same trick with f (x) = x 3 . We have

                                                       n−1
               1      1     1        2           1
                 ·f      + ·f            + ··· + · f
          Ln =
               n      n     n        n           n      n
                             3           1 (n − 1)3
               11       12
             = · 3 + · 3 + ··· + ·
                                               n3
               nn       nn               n
                    3 + 33 + · · · + (n − 1)3
               1+2
             =
                            n3
Cavalieri’s method for different functions
   Try the same trick with f (x) = x 3 . We have

                                                           n−1
               1      1     1        2           1
                 ·f      + ·f            + ··· + · f
          Ln =
               n      n     n        n           n          n
                             3           1 (n − 1)3
               11       12
             = · 3 + · 3 + ··· + ·
                                               n3
               nn       nn               n
                    3 + 33 + · · · + (n − 1)3
               1+2
             =
                            n3
    The formula out of the hat is
                                                                2
              1 + 23 + 33 + · · · + (n − 1)3 =   1
                                                         − 1)
                                                 2 n(n
Cavalieri’s method for different functions
   Try the same trick with f (x) = x 3 . We have

                                                            n−1
               1      1     1        2           1
                 ·f      + ·f            + ··· + · f
          Ln =
               n      n     n        n           n           n
                             3           1 (n − 1)3
               11       12
             = · 3 + · 3 + ··· + ·
                                               n3
               nn       nn               n
                    3 + 33 + · · · + (n − 1)3
               1+2
             =
                            n3
    The formula out of the hat is
                                                                 2
               1 + 23 + 33 + · · · + (n − 1)3 =   1
                                                          − 1)
                                                  2 n(n

    So
                                 n2 (n − 1)2   1
                                             →
                          Ln =          4
                                     4n        4
   as n → ∞.
Cavalieri’s method with different heights



                                  1 13      1 23              1 n3
                                    · 3 + · 3 + ··· + · 3
                             Rn =
                                  nn        nn                nn
                                   3 + 23 + 3 3 + · · · + n 3
                                  1
                                =
                                              n4
                                  11             2
                                = 4 2 n(n + 1)
                                  n
                                  n2 (n + 1)2    1
                                               →
                                =        4
                                      4n         4
                             as n → ∞.
Cavalieri’s method with different heights



                                          1 13      1 23              1 n3
                                            · 3 + · 3 + ··· + · 3
                                     Rn =
                                          nn        nn                nn
                                           3 + 23 + 3 3 + · · · + n 3
                                          1
                                        =
                                                      n4
                                          11             2
                                        = 4 2 n(n + 1)
                                          n
                                          n2 (n + 1)2    1
                                                       →
                                        =        4
                                              4n         4
                                    as n → ∞.
   So even though the rectangles overlap, we still get the same
   answer.
Outline



   Archimedes


   Cavalieri


   Generalizing Cavalieri’s method


   Worksheet
Cavalieri’s method in general
   Let f be a positive function defined on the interval [a, b]. We want
   to find the area between x = a, x = b, y = 0, and y = f (x).
   For each positive integer n, divide up the interval into n pieces.
               b−a
   Then ∆x =          . For each i between 1 and n, let xi be the nth
                  n
   step between a and b. So

                                         x0 = a
                                                             b−a
                                         x1 = x0 + ∆x = a +
                                                                n
                                                                 b−a
                                          x2 = x1 + ∆x = a + 2 ·
                                                                  n
                                         ······
                                                       b−a
                                          xi = a + i ·
                                                        n
                  xi xn−1xn
      x0 x1 x2                           ······
                                                       b−a
      a                  b                xn = a + n ·     =b
                                                        n
Forming Riemann sums

  We have many choices of how to approximate the area:

   Ln = f (x0 )∆x + f (x1 )∆x + · · · + f (xn−1 )∆x
   Rn = f (x1 )∆x + f (x2 )∆x + · · · + f (xn )∆x
             x0 + x1              x1 + x2                    xn−1 + xn
                                            ∆x + · · · + f
  Mn = f               ∆x + f                                            ∆x
                2                    2                           2
Forming Riemann sums

  We have many choices of how to approximate the area:

   Ln = f (x0 )∆x + f (x1 )∆x + · · · + f (xn−1 )∆x
   Rn = f (x1 )∆x + f (x2 )∆x + · · · + f (xn )∆x
             x0 + x1                 x1 + x2                    xn−1 + xn
                                               ∆x + · · · + f
  Mn = f                ∆x + f                                              ∆x
                2                       2                           2

  In general, choose ci to be a point in the ith interval [xi−1 , xi ].
  Form the Riemann sum
               Sn = f (c1 )∆x + f (c2 )∆x + · · · + f (cn )∆x
                        n
                  =          f (ci )∆x
                       i=1
Theorem of the Day




   Theorem
   If f is a continuous function on [a, b] or has finitely many jump
   discontinuities, then

         lim Sn = lim {f (c1 )∆x + f (c2 )∆x + · · · + f (cn )∆x}
        n→∞        n→∞

   exists and is the same value no matter what choice of ci we made.
Outline



   Archimedes


   Cavalieri


   Generalizing Cavalieri’s method


   Worksheet
Worksheet




  We will determine the area under y = e x between x = 0 and x = 1.

Más contenido relacionado

Destacado

Lesson 26: Optimization II: Data Fitting
Lesson 26: Optimization II: Data FittingLesson 26: Optimization II: Data Fitting
Lesson 26: Optimization II: Data FittingMatthew Leingang
 
Lesson20 Tangent Planes Slides+Notes
Lesson20   Tangent Planes Slides+NotesLesson20   Tangent Planes Slides+Notes
Lesson20 Tangent Planes Slides+NotesMatthew Leingang
 
Lesson 25: Unconstrained Optimization I
Lesson 25: Unconstrained Optimization ILesson 25: Unconstrained Optimization I
Lesson 25: Unconstrained Optimization IMatthew Leingang
 
Lesson24 Implicit Differentiation Slides
Lesson24    Implicit  Differentiation SlidesLesson24    Implicit  Differentiation Slides
Lesson24 Implicit Differentiation SlidesMatthew Leingang
 
Lesson 28: Lagrange Multipliers II
Lesson 28: Lagrange  Multipliers IILesson 28: Lagrange  Multipliers II
Lesson 28: Lagrange Multipliers IIMatthew Leingang
 
Lesson 25: Indeterminate Forms and L'Hôpital's Rule
Lesson 25: Indeterminate Forms and L'Hôpital's RuleLesson 25: Indeterminate Forms and L'Hôpital's Rule
Lesson 25: Indeterminate Forms and L'Hôpital's RuleMatthew Leingang
 
Lesson 32: The Fundamental Theorem Of Calculus
Lesson 32: The Fundamental Theorem Of CalculusLesson 32: The Fundamental Theorem Of Calculus
Lesson 32: The Fundamental Theorem Of CalculusMatthew Leingang
 
Lesson 31: Evaluating Definite Integrals
Lesson 31: Evaluating Definite IntegralsLesson 31: Evaluating Definite Integrals
Lesson 31: Evaluating Definite IntegralsMatthew Leingang
 
Lesson 22: Quadratic Forms
Lesson 22: Quadratic FormsLesson 22: Quadratic Forms
Lesson 22: Quadratic FormsMatthew Leingang
 
Lesson 27: Lagrange Multipliers I
Lesson 27: Lagrange Multipliers ILesson 27: Lagrange Multipliers I
Lesson 27: Lagrange Multipliers IMatthew Leingang
 
Midterm II Review Session Slides
Midterm II Review Session SlidesMidterm II Review Session Slides
Midterm II Review Session SlidesMatthew Leingang
 
Lesson 24: Implicit Differentiation
Lesson 24: Implicit DifferentiationLesson 24: Implicit Differentiation
Lesson 24: Implicit DifferentiationMatthew Leingang
 
Lesson 30: The Definite Integral
Lesson 30: The  Definite  IntegralLesson 30: The  Definite  Integral
Lesson 30: The Definite IntegralMatthew Leingang
 
Lesson 34: Introduction To Game Theory
Lesson 34: Introduction To Game TheoryLesson 34: Introduction To Game Theory
Lesson 34: Introduction To Game TheoryMatthew Leingang
 
Lesson 16: Implicit Differentiation
Lesson 16: Implicit DifferentiationLesson 16: Implicit Differentiation
Lesson 16: Implicit DifferentiationMatthew Leingang
 
Lesson 21: Partial Derivatives in Economics
Lesson 21: Partial Derivatives in EconomicsLesson 21: Partial Derivatives in Economics
Lesson 21: Partial Derivatives in EconomicsMatthew Leingang
 
Lesson 30: Duality In Linear Programming
Lesson 30: Duality In Linear ProgrammingLesson 30: Duality In Linear Programming
Lesson 30: Duality In Linear ProgrammingMatthew Leingang
 

Destacado (20)

Lesson 26: Optimization II: Data Fitting
Lesson 26: Optimization II: Data FittingLesson 26: Optimization II: Data Fitting
Lesson 26: Optimization II: Data Fitting
 
Lesson20 Tangent Planes Slides+Notes
Lesson20   Tangent Planes Slides+NotesLesson20   Tangent Planes Slides+Notes
Lesson20 Tangent Planes Slides+Notes
 
Midterm II Review
Midterm II ReviewMidterm II Review
Midterm II Review
 
Lesson 25: Unconstrained Optimization I
Lesson 25: Unconstrained Optimization ILesson 25: Unconstrained Optimization I
Lesson 25: Unconstrained Optimization I
 
Lesson24 Implicit Differentiation Slides
Lesson24    Implicit  Differentiation SlidesLesson24    Implicit  Differentiation Slides
Lesson24 Implicit Differentiation Slides
 
Lesson 28: Lagrange Multipliers II
Lesson 28: Lagrange  Multipliers IILesson 28: Lagrange  Multipliers II
Lesson 28: Lagrange Multipliers II
 
Lesson 25: Indeterminate Forms and L'Hôpital's Rule
Lesson 25: Indeterminate Forms and L'Hôpital's RuleLesson 25: Indeterminate Forms and L'Hôpital's Rule
Lesson 25: Indeterminate Forms and L'Hôpital's Rule
 
Lesson 32: The Fundamental Theorem Of Calculus
Lesson 32: The Fundamental Theorem Of CalculusLesson 32: The Fundamental Theorem Of Calculus
Lesson 32: The Fundamental Theorem Of Calculus
 
Lesson 31: Evaluating Definite Integrals
Lesson 31: Evaluating Definite IntegralsLesson 31: Evaluating Definite Integrals
Lesson 31: Evaluating Definite Integrals
 
Lesson 22: Quadratic Forms
Lesson 22: Quadratic FormsLesson 22: Quadratic Forms
Lesson 22: Quadratic Forms
 
Lesson 23: The Chain Rule
Lesson 23: The Chain RuleLesson 23: The Chain Rule
Lesson 23: The Chain Rule
 
Lesson 27: Lagrange Multipliers I
Lesson 27: Lagrange Multipliers ILesson 27: Lagrange Multipliers I
Lesson 27: Lagrange Multipliers I
 
Midterm II Review Session Slides
Midterm II Review Session SlidesMidterm II Review Session Slides
Midterm II Review Session Slides
 
Lesson 24: Implicit Differentiation
Lesson 24: Implicit DifferentiationLesson 24: Implicit Differentiation
Lesson 24: Implicit Differentiation
 
Lesson 30: The Definite Integral
Lesson 30: The  Definite  IntegralLesson 30: The  Definite  Integral
Lesson 30: The Definite Integral
 
Lesson 19: Related Rates
Lesson 19: Related RatesLesson 19: Related Rates
Lesson 19: Related Rates
 
Lesson 34: Introduction To Game Theory
Lesson 34: Introduction To Game TheoryLesson 34: Introduction To Game Theory
Lesson 34: Introduction To Game Theory
 
Lesson 16: Implicit Differentiation
Lesson 16: Implicit DifferentiationLesson 16: Implicit Differentiation
Lesson 16: Implicit Differentiation
 
Lesson 21: Partial Derivatives in Economics
Lesson 21: Partial Derivatives in EconomicsLesson 21: Partial Derivatives in Economics
Lesson 21: Partial Derivatives in Economics
 
Lesson 30: Duality In Linear Programming
Lesson 30: Duality In Linear ProgrammingLesson 30: Duality In Linear Programming
Lesson 30: Duality In Linear Programming
 

Similar a Math Areas Distances Archimedes Cavalieri Method

Lesson 24: Areas and Distances, The Definite Integral (slides)
Lesson 24: Areas and Distances, The Definite Integral (slides)Lesson 24: Areas and Distances, The Definite Integral (slides)
Lesson 24: Areas and Distances, The Definite Integral (slides)Mel Anthony Pepito
 
Lesson 23: Areas and Distances (Section 10 version)
Lesson 23: Areas and Distances (Section 10 version)Lesson 23: Areas and Distances (Section 10 version)
Lesson 23: Areas and Distances (Section 10 version)Matthew Leingang
 
Lesson 23: Areas And Distances (Section 4 version)
Lesson 23:   Areas And Distances (Section 4 version)Lesson 23:   Areas And Distances (Section 4 version)
Lesson 23: Areas And Distances (Section 4 version)Matthew Leingang
 
Sequence and series 02
Sequence and series 02Sequence and series 02
Sequence and series 02manrak
 
lesson4.-ellipse f.pptx
lesson4.-ellipse f.pptxlesson4.-ellipse f.pptx
lesson4.-ellipse f.pptxninosulit
 
Squares and square roots edmodo 2012 13
Squares and square roots edmodo 2012 13Squares and square roots edmodo 2012 13
Squares and square roots edmodo 2012 13shumwayc
 
Irrational numbers
Irrational numbersIrrational numbers
Irrational numbersTarun Gehlot
 

Similar a Math Areas Distances Archimedes Cavalieri Method (8)

Lesson 24: Areas and Distances, The Definite Integral (slides)
Lesson 24: Areas and Distances, The Definite Integral (slides)Lesson 24: Areas and Distances, The Definite Integral (slides)
Lesson 24: Areas and Distances, The Definite Integral (slides)
 
Lesson 23: Areas and Distances (Section 10 version)
Lesson 23: Areas and Distances (Section 10 version)Lesson 23: Areas and Distances (Section 10 version)
Lesson 23: Areas and Distances (Section 10 version)
 
Lesson 23: Areas And Distances (Section 4 version)
Lesson 23:   Areas And Distances (Section 4 version)Lesson 23:   Areas And Distances (Section 4 version)
Lesson 23: Areas And Distances (Section 4 version)
 
Sequence and series 02
Sequence and series 02Sequence and series 02
Sequence and series 02
 
Cc10 3 geo_har
Cc10 3 geo_harCc10 3 geo_har
Cc10 3 geo_har
 
lesson4.-ellipse f.pptx
lesson4.-ellipse f.pptxlesson4.-ellipse f.pptx
lesson4.-ellipse f.pptx
 
Squares and square roots edmodo 2012 13
Squares and square roots edmodo 2012 13Squares and square roots edmodo 2012 13
Squares and square roots edmodo 2012 13
 
Irrational numbers
Irrational numbersIrrational numbers
Irrational numbers
 

Más de Matthew Leingang

Streamlining assessment, feedback, and archival with auto-multiple-choice
Streamlining assessment, feedback, and archival with auto-multiple-choiceStreamlining assessment, feedback, and archival with auto-multiple-choice
Streamlining assessment, feedback, and archival with auto-multiple-choiceMatthew Leingang
 
Electronic Grading of Paper Assessments
Electronic Grading of Paper AssessmentsElectronic Grading of Paper Assessments
Electronic Grading of Paper AssessmentsMatthew Leingang
 
Lesson 27: Integration by Substitution (slides)
Lesson 27: Integration by Substitution (slides)Lesson 27: Integration by Substitution (slides)
Lesson 27: Integration by Substitution (slides)Matthew Leingang
 
Lesson 26: The Fundamental Theorem of Calculus (slides)
Lesson 26: The Fundamental Theorem of Calculus (slides)Lesson 26: The Fundamental Theorem of Calculus (slides)
Lesson 26: The Fundamental Theorem of Calculus (slides)Matthew Leingang
 
Lesson 26: The Fundamental Theorem of Calculus (slides)
Lesson 26: The Fundamental Theorem of Calculus (slides)Lesson 26: The Fundamental Theorem of Calculus (slides)
Lesson 26: The Fundamental Theorem of Calculus (slides)Matthew Leingang
 
Lesson 27: Integration by Substitution (handout)
Lesson 27: Integration by Substitution (handout)Lesson 27: Integration by Substitution (handout)
Lesson 27: Integration by Substitution (handout)Matthew Leingang
 
Lesson 26: The Fundamental Theorem of Calculus (handout)
Lesson 26: The Fundamental Theorem of Calculus (handout)Lesson 26: The Fundamental Theorem of Calculus (handout)
Lesson 26: The Fundamental Theorem of Calculus (handout)Matthew Leingang
 
Lesson 25: Evaluating Definite Integrals (slides)
Lesson 25: Evaluating Definite Integrals (slides)Lesson 25: Evaluating Definite Integrals (slides)
Lesson 25: Evaluating Definite Integrals (slides)Matthew Leingang
 
Lesson 25: Evaluating Definite Integrals (handout)
Lesson 25: Evaluating Definite Integrals (handout)Lesson 25: Evaluating Definite Integrals (handout)
Lesson 25: Evaluating Definite Integrals (handout)Matthew Leingang
 
Lesson 24: Areas and Distances, The Definite Integral (handout)
Lesson 24: Areas and Distances, The Definite Integral (handout)Lesson 24: Areas and Distances, The Definite Integral (handout)
Lesson 24: Areas and Distances, The Definite Integral (handout)Matthew Leingang
 
Lesson 23: Antiderivatives (slides)
Lesson 23: Antiderivatives (slides)Lesson 23: Antiderivatives (slides)
Lesson 23: Antiderivatives (slides)Matthew Leingang
 
Lesson 23: Antiderivatives (slides)
Lesson 23: Antiderivatives (slides)Lesson 23: Antiderivatives (slides)
Lesson 23: Antiderivatives (slides)Matthew Leingang
 
Lesson 22: Optimization Problems (slides)
Lesson 22: Optimization Problems (slides)Lesson 22: Optimization Problems (slides)
Lesson 22: Optimization Problems (slides)Matthew Leingang
 
Lesson 22: Optimization Problems (handout)
Lesson 22: Optimization Problems (handout)Lesson 22: Optimization Problems (handout)
Lesson 22: Optimization Problems (handout)Matthew Leingang
 
Lesson 21: Curve Sketching (slides)
Lesson 21: Curve Sketching (slides)Lesson 21: Curve Sketching (slides)
Lesson 21: Curve Sketching (slides)Matthew Leingang
 
Lesson 21: Curve Sketching (handout)
Lesson 21: Curve Sketching (handout)Lesson 21: Curve Sketching (handout)
Lesson 21: Curve Sketching (handout)Matthew Leingang
 
Lesson 20: Derivatives and the Shapes of Curves (slides)
Lesson 20: Derivatives and the Shapes of Curves (slides)Lesson 20: Derivatives and the Shapes of Curves (slides)
Lesson 20: Derivatives and the Shapes of Curves (slides)Matthew Leingang
 
Lesson 20: Derivatives and the Shapes of Curves (handout)
Lesson 20: Derivatives and the Shapes of Curves (handout)Lesson 20: Derivatives and the Shapes of Curves (handout)
Lesson 20: Derivatives and the Shapes of Curves (handout)Matthew Leingang
 
Lesson 19: The Mean Value Theorem (slides)
Lesson 19: The Mean Value Theorem (slides)Lesson 19: The Mean Value Theorem (slides)
Lesson 19: The Mean Value Theorem (slides)Matthew Leingang
 

Más de Matthew Leingang (20)

Making Lesson Plans
Making Lesson PlansMaking Lesson Plans
Making Lesson Plans
 
Streamlining assessment, feedback, and archival with auto-multiple-choice
Streamlining assessment, feedback, and archival with auto-multiple-choiceStreamlining assessment, feedback, and archival with auto-multiple-choice
Streamlining assessment, feedback, and archival with auto-multiple-choice
 
Electronic Grading of Paper Assessments
Electronic Grading of Paper AssessmentsElectronic Grading of Paper Assessments
Electronic Grading of Paper Assessments
 
Lesson 27: Integration by Substitution (slides)
Lesson 27: Integration by Substitution (slides)Lesson 27: Integration by Substitution (slides)
Lesson 27: Integration by Substitution (slides)
 
Lesson 26: The Fundamental Theorem of Calculus (slides)
Lesson 26: The Fundamental Theorem of Calculus (slides)Lesson 26: The Fundamental Theorem of Calculus (slides)
Lesson 26: The Fundamental Theorem of Calculus (slides)
 
Lesson 26: The Fundamental Theorem of Calculus (slides)
Lesson 26: The Fundamental Theorem of Calculus (slides)Lesson 26: The Fundamental Theorem of Calculus (slides)
Lesson 26: The Fundamental Theorem of Calculus (slides)
 
Lesson 27: Integration by Substitution (handout)
Lesson 27: Integration by Substitution (handout)Lesson 27: Integration by Substitution (handout)
Lesson 27: Integration by Substitution (handout)
 
Lesson 26: The Fundamental Theorem of Calculus (handout)
Lesson 26: The Fundamental Theorem of Calculus (handout)Lesson 26: The Fundamental Theorem of Calculus (handout)
Lesson 26: The Fundamental Theorem of Calculus (handout)
 
Lesson 25: Evaluating Definite Integrals (slides)
Lesson 25: Evaluating Definite Integrals (slides)Lesson 25: Evaluating Definite Integrals (slides)
Lesson 25: Evaluating Definite Integrals (slides)
 
Lesson 25: Evaluating Definite Integrals (handout)
Lesson 25: Evaluating Definite Integrals (handout)Lesson 25: Evaluating Definite Integrals (handout)
Lesson 25: Evaluating Definite Integrals (handout)
 
Lesson 24: Areas and Distances, The Definite Integral (handout)
Lesson 24: Areas and Distances, The Definite Integral (handout)Lesson 24: Areas and Distances, The Definite Integral (handout)
Lesson 24: Areas and Distances, The Definite Integral (handout)
 
Lesson 23: Antiderivatives (slides)
Lesson 23: Antiderivatives (slides)Lesson 23: Antiderivatives (slides)
Lesson 23: Antiderivatives (slides)
 
Lesson 23: Antiderivatives (slides)
Lesson 23: Antiderivatives (slides)Lesson 23: Antiderivatives (slides)
Lesson 23: Antiderivatives (slides)
 
Lesson 22: Optimization Problems (slides)
Lesson 22: Optimization Problems (slides)Lesson 22: Optimization Problems (slides)
Lesson 22: Optimization Problems (slides)
 
Lesson 22: Optimization Problems (handout)
Lesson 22: Optimization Problems (handout)Lesson 22: Optimization Problems (handout)
Lesson 22: Optimization Problems (handout)
 
Lesson 21: Curve Sketching (slides)
Lesson 21: Curve Sketching (slides)Lesson 21: Curve Sketching (slides)
Lesson 21: Curve Sketching (slides)
 
Lesson 21: Curve Sketching (handout)
Lesson 21: Curve Sketching (handout)Lesson 21: Curve Sketching (handout)
Lesson 21: Curve Sketching (handout)
 
Lesson 20: Derivatives and the Shapes of Curves (slides)
Lesson 20: Derivatives and the Shapes of Curves (slides)Lesson 20: Derivatives and the Shapes of Curves (slides)
Lesson 20: Derivatives and the Shapes of Curves (slides)
 
Lesson 20: Derivatives and the Shapes of Curves (handout)
Lesson 20: Derivatives and the Shapes of Curves (handout)Lesson 20: Derivatives and the Shapes of Curves (handout)
Lesson 20: Derivatives and the Shapes of Curves (handout)
 
Lesson 19: The Mean Value Theorem (slides)
Lesson 19: The Mean Value Theorem (slides)Lesson 19: The Mean Value Theorem (slides)
Lesson 19: The Mean Value Theorem (slides)
 

Último

TrustArc Webinar - How to Build Consumer Trust Through Data Privacy
TrustArc Webinar - How to Build Consumer Trust Through Data PrivacyTrustArc Webinar - How to Build Consumer Trust Through Data Privacy
TrustArc Webinar - How to Build Consumer Trust Through Data PrivacyTrustArc
 
Connect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck PresentationConnect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck PresentationSlibray Presentation
 
Use of FIDO in the Payments and Identity Landscape: FIDO Paris Seminar.pptx
Use of FIDO in the Payments and Identity Landscape: FIDO Paris Seminar.pptxUse of FIDO in the Payments and Identity Landscape: FIDO Paris Seminar.pptx
Use of FIDO in the Payments and Identity Landscape: FIDO Paris Seminar.pptxLoriGlavin3
 
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)Mark Simos
 
Unraveling Multimodality with Large Language Models.pdf
Unraveling Multimodality with Large Language Models.pdfUnraveling Multimodality with Large Language Models.pdf
Unraveling Multimodality with Large Language Models.pdfAlex Barbosa Coqueiro
 
The Role of FIDO in a Cyber Secure Netherlands: FIDO Paris Seminar.pptx
The Role of FIDO in a Cyber Secure Netherlands: FIDO Paris Seminar.pptxThe Role of FIDO in a Cyber Secure Netherlands: FIDO Paris Seminar.pptx
The Role of FIDO in a Cyber Secure Netherlands: FIDO Paris Seminar.pptxLoriGlavin3
 
What is DBT - The Ultimate Data Build Tool.pdf
What is DBT - The Ultimate Data Build Tool.pdfWhat is DBT - The Ultimate Data Build Tool.pdf
What is DBT - The Ultimate Data Build Tool.pdfMounikaPolabathina
 
New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024
New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024
New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024BookNet Canada
 
Digital Identity is Under Attack: FIDO Paris Seminar.pptx
Digital Identity is Under Attack: FIDO Paris Seminar.pptxDigital Identity is Under Attack: FIDO Paris Seminar.pptx
Digital Identity is Under Attack: FIDO Paris Seminar.pptxLoriGlavin3
 
The Fit for Passkeys for Employee and Consumer Sign-ins: FIDO Paris Seminar.pptx
The Fit for Passkeys for Employee and Consumer Sign-ins: FIDO Paris Seminar.pptxThe Fit for Passkeys for Employee and Consumer Sign-ins: FIDO Paris Seminar.pptx
The Fit for Passkeys for Employee and Consumer Sign-ins: FIDO Paris Seminar.pptxLoriGlavin3
 
DSPy a system for AI to Write Prompts and Do Fine Tuning
DSPy a system for AI to Write Prompts and Do Fine TuningDSPy a system for AI to Write Prompts and Do Fine Tuning
DSPy a system for AI to Write Prompts and Do Fine TuningLars Bell
 
Commit 2024 - Secret Management made easy
Commit 2024 - Secret Management made easyCommit 2024 - Secret Management made easy
Commit 2024 - Secret Management made easyAlfredo García Lavilla
 
How AI, OpenAI, and ChatGPT impact business and software.
How AI, OpenAI, and ChatGPT impact business and software.How AI, OpenAI, and ChatGPT impact business and software.
How AI, OpenAI, and ChatGPT impact business and software.Curtis Poe
 
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptx
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptxPasskey Providers and Enabling Portability: FIDO Paris Seminar.pptx
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptxLoriGlavin3
 
Unleash Your Potential - Namagunga Girls Coding Club
Unleash Your Potential - Namagunga Girls Coding ClubUnleash Your Potential - Namagunga Girls Coding Club
Unleash Your Potential - Namagunga Girls Coding ClubKalema Edgar
 
Transcript: New from BookNet Canada for 2024: Loan Stars - Tech Forum 2024
Transcript: New from BookNet Canada for 2024: Loan Stars - Tech Forum 2024Transcript: New from BookNet Canada for 2024: Loan Stars - Tech Forum 2024
Transcript: New from BookNet Canada for 2024: Loan Stars - Tech Forum 2024BookNet Canada
 
Advanced Computer Architecture – An Introduction
Advanced Computer Architecture – An IntroductionAdvanced Computer Architecture – An Introduction
Advanced Computer Architecture – An IntroductionDilum Bandara
 
Moving Beyond Passwords: FIDO Paris Seminar.pdf
Moving Beyond Passwords: FIDO Paris Seminar.pdfMoving Beyond Passwords: FIDO Paris Seminar.pdf
Moving Beyond Passwords: FIDO Paris Seminar.pdfLoriGlavin3
 
Generative AI for Technical Writer or Information Developers
Generative AI for Technical Writer or Information DevelopersGenerative AI for Technical Writer or Information Developers
Generative AI for Technical Writer or Information DevelopersRaghuram Pandurangan
 
SIP trunking in Janus @ Kamailio World 2024
SIP trunking in Janus @ Kamailio World 2024SIP trunking in Janus @ Kamailio World 2024
SIP trunking in Janus @ Kamailio World 2024Lorenzo Miniero
 

Último (20)

TrustArc Webinar - How to Build Consumer Trust Through Data Privacy
TrustArc Webinar - How to Build Consumer Trust Through Data PrivacyTrustArc Webinar - How to Build Consumer Trust Through Data Privacy
TrustArc Webinar - How to Build Consumer Trust Through Data Privacy
 
Connect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck PresentationConnect Wave/ connectwave Pitch Deck Presentation
Connect Wave/ connectwave Pitch Deck Presentation
 
Use of FIDO in the Payments and Identity Landscape: FIDO Paris Seminar.pptx
Use of FIDO in the Payments and Identity Landscape: FIDO Paris Seminar.pptxUse of FIDO in the Payments and Identity Landscape: FIDO Paris Seminar.pptx
Use of FIDO in the Payments and Identity Landscape: FIDO Paris Seminar.pptx
 
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
Tampa BSides - Chef's Tour of Microsoft Security Adoption Framework (SAF)
 
Unraveling Multimodality with Large Language Models.pdf
Unraveling Multimodality with Large Language Models.pdfUnraveling Multimodality with Large Language Models.pdf
Unraveling Multimodality with Large Language Models.pdf
 
The Role of FIDO in a Cyber Secure Netherlands: FIDO Paris Seminar.pptx
The Role of FIDO in a Cyber Secure Netherlands: FIDO Paris Seminar.pptxThe Role of FIDO in a Cyber Secure Netherlands: FIDO Paris Seminar.pptx
The Role of FIDO in a Cyber Secure Netherlands: FIDO Paris Seminar.pptx
 
What is DBT - The Ultimate Data Build Tool.pdf
What is DBT - The Ultimate Data Build Tool.pdfWhat is DBT - The Ultimate Data Build Tool.pdf
What is DBT - The Ultimate Data Build Tool.pdf
 
New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024
New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024
New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024
 
Digital Identity is Under Attack: FIDO Paris Seminar.pptx
Digital Identity is Under Attack: FIDO Paris Seminar.pptxDigital Identity is Under Attack: FIDO Paris Seminar.pptx
Digital Identity is Under Attack: FIDO Paris Seminar.pptx
 
The Fit for Passkeys for Employee and Consumer Sign-ins: FIDO Paris Seminar.pptx
The Fit for Passkeys for Employee and Consumer Sign-ins: FIDO Paris Seminar.pptxThe Fit for Passkeys for Employee and Consumer Sign-ins: FIDO Paris Seminar.pptx
The Fit for Passkeys for Employee and Consumer Sign-ins: FIDO Paris Seminar.pptx
 
DSPy a system for AI to Write Prompts and Do Fine Tuning
DSPy a system for AI to Write Prompts and Do Fine TuningDSPy a system for AI to Write Prompts and Do Fine Tuning
DSPy a system for AI to Write Prompts and Do Fine Tuning
 
Commit 2024 - Secret Management made easy
Commit 2024 - Secret Management made easyCommit 2024 - Secret Management made easy
Commit 2024 - Secret Management made easy
 
How AI, OpenAI, and ChatGPT impact business and software.
How AI, OpenAI, and ChatGPT impact business and software.How AI, OpenAI, and ChatGPT impact business and software.
How AI, OpenAI, and ChatGPT impact business and software.
 
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptx
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptxPasskey Providers and Enabling Portability: FIDO Paris Seminar.pptx
Passkey Providers and Enabling Portability: FIDO Paris Seminar.pptx
 
Unleash Your Potential - Namagunga Girls Coding Club
Unleash Your Potential - Namagunga Girls Coding ClubUnleash Your Potential - Namagunga Girls Coding Club
Unleash Your Potential - Namagunga Girls Coding Club
 
Transcript: New from BookNet Canada for 2024: Loan Stars - Tech Forum 2024
Transcript: New from BookNet Canada for 2024: Loan Stars - Tech Forum 2024Transcript: New from BookNet Canada for 2024: Loan Stars - Tech Forum 2024
Transcript: New from BookNet Canada for 2024: Loan Stars - Tech Forum 2024
 
Advanced Computer Architecture – An Introduction
Advanced Computer Architecture – An IntroductionAdvanced Computer Architecture – An Introduction
Advanced Computer Architecture – An Introduction
 
Moving Beyond Passwords: FIDO Paris Seminar.pdf
Moving Beyond Passwords: FIDO Paris Seminar.pdfMoving Beyond Passwords: FIDO Paris Seminar.pdf
Moving Beyond Passwords: FIDO Paris Seminar.pdf
 
Generative AI for Technical Writer or Information Developers
Generative AI for Technical Writer or Information DevelopersGenerative AI for Technical Writer or Information Developers
Generative AI for Technical Writer or Information Developers
 
SIP trunking in Janus @ Kamailio World 2024
SIP trunking in Janus @ Kamailio World 2024SIP trunking in Janus @ Kamailio World 2024
SIP trunking in Janus @ Kamailio World 2024
 

Math Areas Distances Archimedes Cavalieri Method

  • 1. Section 5.1 Areas and Distances Math 1a December 5, 2007 Announcements my next office hours: Today 1–3 (SC 323) MT II is nearly graded. You’ll get it back Friday Final seview sessions: Wed 1/9 and Thu 1/10 in Hall D, Sun 1/13 in Hall C, all 7–8:30pm Final tentatively scheduled for January 17
  • 2. Outline Archimedes Cavalieri Generalizing Cavalieri’s method Worksheet
  • 3. Meet the mathematician: Archimedes 287 BC – 212 BC (after Euclid) Geometer Weapons engineer
  • 4. Archimedes found areas of a sequence of triangles inscribed in a parabola. A=
  • 5. 1 Archimedes found areas of a sequence of triangles inscribed in a parabola. A=1
  • 6. 1 1 1 8 8 Archimedes found areas of a sequence of triangles inscribed in a parabola. 1 A=1+2· 8
  • 7. 1 1 64 64 1 1 1 8 8 1 1 64 64 Archimedes found areas of a sequence of triangles inscribed in a parabola. 1 1 A=1+2· +4· + ··· 8 64
  • 8. 1 1 64 64 1 1 1 8 8 1 1 64 64 Archimedes found areas of a sequence of triangles inscribed in a parabola. 1 1 A=1+2· +4· + ··· 8 64 1 1 1 + ··· + n + ··· =1+ + 4 16 4
  • 9. We would then need to know the value of the series 1 1 1 + ··· + n + ··· 1+ + 4 16 4 But for any number r and any positive integer n, (1 − x)(1 + r + · · · + r n ) = 1 − r n+1 So 1 − r n+1 1 + r + · · · + rn = 1−r Therefore 1 − (1/4)n+1 1 1 1 1 4 + ··· + n = →3 = 1+ + 1 − 1/4 4 16 4 /4 3 as n → ∞.
  • 10. Outline Archimedes Cavalieri Generalizing Cavalieri’s method Worksheet
  • 11. Cavalieri Italian, 1598–1647 Revisited the area problem with a different perspective
  • 12. Cavalieri’s method Divide up the interval into pieces and measure the area of the inscribed rectangles:
  • 13. Cavalieri’s method Divide up the interval into pieces and measure the area of the inscribed rectangles: 1 L2 = 8
  • 14. Cavalieri’s method Divide up the interval into pieces and measure the area of the inscribed rectangles: 1 L2 = 8 L3 =
  • 15. Cavalieri’s method Divide up the interval into pieces and measure the area of the inscribed rectangles: 1 L2 = 8 1 4 5 L3 = + = 27 27 27
  • 16. Cavalieri’s method Divide up the interval into pieces and measure the area of the inscribed rectangles: 1 L2 = 8 1 4 5 L3 = + = 27 27 27 L4 =
  • 17. Cavalieri’s method Divide up the interval into pieces and measure the area of the inscribed rectangles: 1 L2 = 8 1 4 5 L3 = + = 27 27 27 1 4 9 14 L4 = + + = 64 64 64 64
  • 18. Cavalieri’s method Divide up the interval into pieces and measure the area of the inscribed rectangles: 1 L2 = 8 1 4 5 L3 = + = 27 27 27 1 4 9 14 L4 = + + = 64 64 64 64 L5 =
  • 19. Cavalieri’s method Divide up the interval into pieces and measure the area of the inscribed rectangles: 1 L2 = 8 1 4 5 L3 = + = 27 27 27 1 4 9 14 L4 = + + = 64 64 64 64 1 4 9 16 30 L5 = + + + = 125 125 125 25 125
  • 20. Cavalieri’s method Divide up the interval into pieces and measure the area of the inscribed rectangles: 1 L2 = 8 1 4 5 L3 = + = 27 27 27 1 4 9 14 L4 = + + = 64 64 64 64 1 4 9 16 30 L5 = + + + = 125 125 125 25 125 Ln =?
  • 21. What is Ln ? 1 Divide the interval [0, 1] into n pieces. Then each has width . n
  • 22. What is Ln ? 1 Divide the interval [0, 1] into n pieces. Then each has width . n The rectangle over the ith interval and under the parabola has area 2 (i − 1)2 i −1 1 · = . n3 n n
  • 23. What is Ln ? 1 Divide the interval [0, 1] into n pieces. Then each has width . n The rectangle over the ith interval and under the parabola has area 2 (i − 1)2 i −1 1 · = . n3 n n So 22 (n − 1)2 1 + 22 + 32 + · · · + (n − 1)2 1 + 3 + ··· + Ln = = n3 n n3 n3
  • 24. What is Ln ? 1 Divide the interval [0, 1] into n pieces. Then each has width . n The rectangle over the ith interval and under the parabola has area 2 (i − 1)2 i −1 1 · = . n3 n n So 22 (n − 1)2 1 + 22 + 32 + · · · + (n − 1)2 1 + 3 + ··· + Ln = = n3 n n3 n3 The Arabs knew that n(n − 1)(2n − 1) 1 + 22 + 32 + · · · + (n − 1)2 = 6 So n(n − 1)(2n − 1) Ln = 6n3
  • 25. What is Ln ? 1 Divide the interval [0, 1] into n pieces. Then each has width . n The rectangle over the ith interval and under the parabola has area 2 (i − 1)2 i −1 1 · = . n3 n n So 22 (n − 1)2 1 + 22 + 32 + · · · + (n − 1)2 1 + 3 + ··· + Ln = = n3 n n3 n3 The Arabs knew that n(n − 1)(2n − 1) 1 + 22 + 32 + · · · + (n − 1)2 = 6 So n(n − 1)(2n − 1) 1 → Ln = 3 6n 3 as n → ∞.
  • 26. Cavalieri’s method for different functions Try the same trick with f (x) = x 3 . We have n−1 1 1 1 2 1 ·f ·f + ··· + ·f Ln = + n n n n n n
  • 27. Cavalieri’s method for different functions Try the same trick with f (x) = x 3 . We have n−1 1 1 1 2 1 ·f + ·f + ··· + · f Ln = n n n n n n 3 1 (n − 1)3 11 12 = · 3 + · 3 + ··· + · n3 nn nn n
  • 28. Cavalieri’s method for different functions Try the same trick with f (x) = x 3 . We have n−1 1 1 1 2 1 ·f + ·f + ··· + · f Ln = n n n n n n 3 1 (n − 1)3 11 12 = · 3 + · 3 + ··· + · n3 nn nn n 3 + 33 + · · · + (n − 1)3 1+2 = n3
  • 29. Cavalieri’s method for different functions Try the same trick with f (x) = x 3 . We have n−1 1 1 1 2 1 ·f + ·f + ··· + · f Ln = n n n n n n 3 1 (n − 1)3 11 12 = · 3 + · 3 + ··· + · n3 nn nn n 3 + 33 + · · · + (n − 1)3 1+2 = n3 The formula out of the hat is 2 1 + 23 + 33 + · · · + (n − 1)3 = 1 − 1) 2 n(n
  • 30. Cavalieri’s method for different functions Try the same trick with f (x) = x 3 . We have n−1 1 1 1 2 1 ·f + ·f + ··· + · f Ln = n n n n n n 3 1 (n − 1)3 11 12 = · 3 + · 3 + ··· + · n3 nn nn n 3 + 33 + · · · + (n − 1)3 1+2 = n3 The formula out of the hat is 2 1 + 23 + 33 + · · · + (n − 1)3 = 1 − 1) 2 n(n So n2 (n − 1)2 1 → Ln = 4 4n 4 as n → ∞.
  • 31. Cavalieri’s method with different heights 1 13 1 23 1 n3 · 3 + · 3 + ··· + · 3 Rn = nn nn nn 3 + 23 + 3 3 + · · · + n 3 1 = n4 11 2 = 4 2 n(n + 1) n n2 (n + 1)2 1 → = 4 4n 4 as n → ∞.
  • 32. Cavalieri’s method with different heights 1 13 1 23 1 n3 · 3 + · 3 + ··· + · 3 Rn = nn nn nn 3 + 23 + 3 3 + · · · + n 3 1 = n4 11 2 = 4 2 n(n + 1) n n2 (n + 1)2 1 → = 4 4n 4 as n → ∞. So even though the rectangles overlap, we still get the same answer.
  • 33. Outline Archimedes Cavalieri Generalizing Cavalieri’s method Worksheet
  • 34. Cavalieri’s method in general Let f be a positive function defined on the interval [a, b]. We want to find the area between x = a, x = b, y = 0, and y = f (x). For each positive integer n, divide up the interval into n pieces. b−a Then ∆x = . For each i between 1 and n, let xi be the nth n step between a and b. So x0 = a b−a x1 = x0 + ∆x = a + n b−a x2 = x1 + ∆x = a + 2 · n ······ b−a xi = a + i · n xi xn−1xn x0 x1 x2 ······ b−a a b xn = a + n · =b n
  • 35. Forming Riemann sums We have many choices of how to approximate the area: Ln = f (x0 )∆x + f (x1 )∆x + · · · + f (xn−1 )∆x Rn = f (x1 )∆x + f (x2 )∆x + · · · + f (xn )∆x x0 + x1 x1 + x2 xn−1 + xn ∆x + · · · + f Mn = f ∆x + f ∆x 2 2 2
  • 36. Forming Riemann sums We have many choices of how to approximate the area: Ln = f (x0 )∆x + f (x1 )∆x + · · · + f (xn−1 )∆x Rn = f (x1 )∆x + f (x2 )∆x + · · · + f (xn )∆x x0 + x1 x1 + x2 xn−1 + xn ∆x + · · · + f Mn = f ∆x + f ∆x 2 2 2 In general, choose ci to be a point in the ith interval [xi−1 , xi ]. Form the Riemann sum Sn = f (c1 )∆x + f (c2 )∆x + · · · + f (cn )∆x n = f (ci )∆x i=1
  • 37. Theorem of the Day Theorem If f is a continuous function on [a, b] or has finitely many jump discontinuities, then lim Sn = lim {f (c1 )∆x + f (c2 )∆x + · · · + f (cn )∆x} n→∞ n→∞ exists and is the same value no matter what choice of ci we made.
  • 38. Outline Archimedes Cavalieri Generalizing Cavalieri’s method Worksheet
  • 39. Worksheet We will determine the area under y = e x between x = 0 and x = 1.