sum of squares sig max i 1207
DESCRIPTION
A powerpoint on summationsTRANSCRIPT
![Page 1: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/1.jpg)
Intuitively clearer proofs of the sum of squares formula
Jonathan A. CoxSUNY Fredonia Sigma Xi
December 7, 2007
![Page 2: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/2.jpg)
Riemann sums
Area under curve ≈ sum of areas of rectanglesΔx=width of each rectangle
Area ≈ Σf(xi)Δx
![Page 3: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/3.jpg)
Handy formulas for computing Riemann sums
![Page 4: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/4.jpg)
Handy formulas for computing Riemann sums
• Sum of integers
![Page 5: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/5.jpg)
Handy formulas for computing Riemann sums
• Sum of integers
• Sum of squares
![Page 6: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/6.jpg)
Handy formulas for computing Riemann sums
• Sum of integers
• Sum of squares
• Sum of cubes
![Page 7: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/7.jpg)
Handy formulas for computing Riemann sums
• Sum of integers
• Sum of squares
• Sum of cubes
• Even fourth powers!*
*D. Varberg and E. Purcell. Calculus with Analytic Geometry. Sixth Ed.
![Page 8: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/8.jpg)
Why is ?
![Page 9: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/9.jpg)
Why is ?
Gauss Legend
1 + 2 + 3 + + 49 + 50 + 51 + 52 + + 98 + 99 + 100∙ ∙ ∙ ∙ ∙ ∙
![Page 10: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/10.jpg)
Why is ?
Gauss Legend
1 + 2 + 3 + + 49 + 50 + 51 + 52 + + 98 + 99 + 100∙ ∙ ∙ ∙ ∙ ∙
![Page 11: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/11.jpg)
Why is ?
Gauss Legend
1 + 2 + 3 + + 49 + 50 + 51 + 52 + + 98 + 99 + 100∙ ∙ ∙ ∙ ∙ ∙
50 pairs, each with sum 101
![Page 12: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/12.jpg)
Standard proofs of sum of squares
![Page 13: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/13.jpg)
Standard proofs of sum of squares
• Induction
![Page 14: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/14.jpg)
Induction Proof of .
• Base case: Let n=1. Then
• Induction step: Assume the formula is holds for n and show that it works for n+1.
![Page 15: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/15.jpg)
Standard proofs of sum of squares
• Induction• Telescoping sum of cubes
![Page 16: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/16.jpg)
Standard proofs of sum of squares
• Induction• Telescoping sum of cubes
These proofs are not intuitively clear!
![Page 17: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/17.jpg)
Regrouping the sum by odds
• Every perfect square is a sum of consecutive odd numbers.
• 36=1+3+5+7+9+11• Write each square in the sum as a sum of odds.• Regroup all like odds together and add these
first.• These two different ways of summing the
squares give an equality which can be solved for the desired sum.
![Page 18: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/18.jpg)
Regrouping the sum by odds
![Page 19: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/19.jpg)
Regrouping the sum by odds
![Page 20: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/20.jpg)
Regrouping the sum by odds
• Better, but not intuitively clear
![Page 21: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/21.jpg)
Regrouping the sum by odds
• Better, but not intuitively clear• Involves algebraic acrobatics
![Page 22: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/22.jpg)
Regrouping the sum by odds
• Better, but not intuitively clear• Involves algebraic acrobatics• Had this explanation been discovered
previously?
![Page 23: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/23.jpg)
Regrouping the sum by odds
• Better, but not intuitively clear• Involves algebraic acrobatics• Had this explanation been discovered
previously?• Martin Gardner’s skyscraper construction
(Knotted Doughnuts and other Mathematical Entertainments)
![Page 24: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/24.jpg)
The quest for an intuitively clear proof• Benjamin, Quinn and Wurtz give a proof by
counting squares on an n x n chessboard in 2 different ways. (College Math. J., 2006)
• Benjamin and Quinn give another “purely combinatorial” proof in Proofs that Really Count.
• There are more than 10 different proofs!• And………………….• SOME OF THEM ARE INTUITIVELY CLEAR! • We’ll look at up to five of the remaining proofs
(as time permits).
![Page 26: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/26.jpg)
Solving a linear system
• By Don Cohen, from www.mathman.biz• Assume the formula is a polynomial in n
![Page 27: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/27.jpg)
Solving a linear system
• By Don Cohen, from www.mathman.biz• Assume the formula is a polynomial in n• First, what’s the degree of the polynomial?
![Page 28: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/28.jpg)
Solving a linear system
• By Don Cohen, from www.mathman.biz• Assume the formula is a polynomial in n• First, what’s the degree of the polynomial?• The third differences are constant, so the
formula will be cubic.
![Page 29: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/29.jpg)
Solving a linear system
• By Don Cohen, from www.mathman.biz• Assume the formula is a polynomial in n• First, what’s the degree of the polynomial?• The third differences are constant, so the
formula will be cubic.• Want to find the 4 coefficients (variables)
![Page 30: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/30.jpg)
Solving a linear system
• By Don Cohen, from www.mathman.biz• Assume the formula is a polynomial in n• First, what’s the degree of the polynomial?• The third differences are constant, so the
formula will be cubic.• Want to find the 4 coefficients (variables)• First 4 sums of squares give 4 equations
![Page 31: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/31.jpg)
Solving a linear system
• By Don Cohen, from www.mathman.biz• Assume the formula is a polynomial in n• First, what’s the degree of the polynomial?• The third differences are constant, so the
formula will be cubic.• Want to find the 4 coefficients (variables)• First 4 sums of squares give 4 equations• Solve system of 4 linear equations in 4 variables
![Page 32: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/32.jpg)
Looking to geometry
![Page 33: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/33.jpg)
Looking to geometryA sum of squares ≈ volume of a pyramid with
square base
Source: David Bressoud, Calculus Before Newton and Leibniz: Part II, http://www.macalester.edu/~bressoud/pub/CBN2.pdf
![Page 34: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/34.jpg)
“Fiddling with the bits that stick out"
• Sum of squares = volume of the pyramid• Why not just use volume formula for a pyramid?• It’s not a true pyramid, more like a staircase….
"A very pleasant extension to stacking oranges is to consider the relationship between the volume of the indicative pyramid and the sum of squares, taking cubic oranges of one unit of volume. This, eventually, after some fiddling to account for bits that stick out and bits that stick in, generates the formula for summing squares." (A.W., UK)
http://nrich.maths.org/public/viewer.php?obj_id=2497
![Page 35: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/35.jpg)
“Fiddling with the bits that stick out"
• Underlying pyramid has volume n3/3• Add in the half-cubes (triangular prisms) above the slice• Subtract off volumes of n little pyramids added twice
![Page 36: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/36.jpg)
Archimedes’ proof with pyramids (D. Bressoud -- http://www.macalester.edu/~bressoud/pub/CBN2.pdf)
![Page 37: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/37.jpg)
Archimedes’ proof with pyramids (D. Bressoud -- http://www.macalester.edu/~bressoud/pub/CBN2.pdf)
![Page 38: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/38.jpg)
Winner 1: The Greek rectangle methodDoug Williams, http://www.mav.vic.edu.au/PSTC/cc/pyramids.htm
• This is the same construction that Martin Gardner described using skyscrapers!
![Page 39: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/39.jpg)
Winner 1: The Greek rectangle method
Doug Williams, http://www.mav.vic.edu.au/PSTC/cc/pyramids.htm
![Page 40: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/40.jpg)
Winner 1: The Greek rectangle methodHow Martin Gardner described it as a skyscraper
![Page 41: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/41.jpg)
Winner 1: The Greek rectangle methodDoug Williams, http://www.mav.vic.edu.au/PSTC/cc/pyramids.htm
• This is the same construction that Martin Gardner described using skyscrapers!
• Flesh out the skyscaper with a sequence of squares on each side to make a rectangle.
• Each sequence of squares has area !
• The rectangle has dimensions n(n+1)/2 and 2n+1 !
![Page 42: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/42.jpg)
Winner 1: The Greek rectangle method
Doug Williams, http://www.mav.vic.edu.au/PSTC/cc/pyramids.htm
![Page 43: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/43.jpg)
By the way…• The sum of integers formula can be proved
with a similar geometric construction.(D. Bressoud -- http://www.macalester.edu/~bressoud/pub/CBN2.pdf)
![Page 44: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/44.jpg)
Winner 2: The six-pyramid constructionDoug Williams, http://www.mav.vic.edu.au/PSTC/cc/pyramids.htm
• 6 identical “sum of first n squares” pyramids• Fit them together to form a rectangular prism• It has dimensions n, n+1, and 2n+1• Thus
• It’s fairly easy to see that this works for n+1 if it works for n.
![Page 45: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/45.jpg)
Winner 2: The six-pyramid constructionDoug Williams, http://www.mav.vic.edu.au/PSTC/cc/pyramids.htm
• 6 identical “sum of first n squares” pyramids• Fit them together to form a rectangular prism• It has dimensions n, n+1, and 2n+1• Thus
• It’s fairly easy to see that this works for n+1 if it works for n. (Induction?!)
![Page 46: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/46.jpg)
What makes a good proof?
![Page 47: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/47.jpg)
What makes a good proof?
• It should convince the intended audience that the statement is true.
![Page 48: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/48.jpg)
Appendix: Ways of proving sum of squares formula
1. Induction2. Telescoping cubic sum3. Regrouping as odds4. Pyramid of cubes--fiddling to account for bits5. Three lines on chessboard (Benjamin-Quinn-Wurtz)6. Combinatorial (Benjamin-Quinn)7. Archimedes: Fitting together three pyramids8. Solving a system of 4 linear equations in 4 variables9. Fitting together six pyramids10.Greek rectangles (Martin Gardner's skyscraper)11.Integration
![Page 49: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/49.jpg)
Sum of cubesHow many rectangles are there on a chessboard?
9 horizontal lines9 vertical lines
Choose two of each
rectangles on an 8 x 8 board In general,
there are rectangles on an n x n board.
![Page 50: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/50.jpg)
Sum of cubesBut the number of rectangles is also !
There are k3 rectangleswith maximum
coordinate k.
Source: A. Benjamin, J. Quinn and C. Wurtz.Summing cubes by counting rectangles, CMJ, 2006.
![Page 51: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/51.jpg)
Can we do sum of squares on the chessboard?
• The number of squares on an n x n chessboard is
• .
• .
Perhaps choosing three total horizontal and vertical lines determines four squares….
This approach doesn’t seem to work.
![Page 52: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/52.jpg)
Can we do sum of squares on the chessboard?Yes!
![Page 53: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/53.jpg)
Can we do sum of squares on the chessboard?Yes!Benjamin, Quinn, and Wurtz do this.
![Page 54: Sum of Squares Sig Max i 1207](https://reader034.vdocuments.mx/reader034/viewer/2022050904/545a58b7af79594e128b54c0/html5/thumbnails/54.jpg)
Can we do sum of squares on the chessboard?Yes!Benjamin, Quinn, and Wurtz do this.
This is still lacking in intuitive clarity….