1 / 21

Using “Pascal’s” triangle to sum k th powers of consecutive integers

Using “Pascal’s” triangle to sum k th powers of consecutive integers. Al-Bahir fi'l Hisab (Shining Treatise on Calculation) , al- Samaw'al, Iraq, 1144 Siyuan Yujian (Jade Mirror of the Four Unknowns) , Zhu Shijie, China, 1303

tait
Download Presentation

Using “Pascal’s” triangle to sum k th powers of consecutive integers

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Using “Pascal’s” triangle to sum kth powers of consecutive integers Al-Bahir fi'l Hisab (Shining Treatise on Calculation), al- Samaw'al, Iraq, 1144 Siyuan Yujian (Jade Mirror of the Four Unknowns), Zhu Shijie, China, 1303 Maasei Hoshev (The Art of the Calculator), Levi ben Gerson, France, 1321 Ganita Kaumudi (Treatise on Calculation), Narayana Pandita, India, 1356

  2. Note that the binomial coefficient j choose k is a polynomial in j of degree k.

  3. All the coefficients are positive integers. Can we find a simple way of generating them? Can we discover what they count?

  4. HP(k,i ) is the House-Painting number 1 2 3 4 5 6 7 8 It is the number of ways of painting k houses using exactlyi colors.

  5. 1 2 1 6 6 1 24 36 14 1

  6. HP(k,i ) is the House-Painting number 1 2 3 4 5 6 7 8

  7. 1 2 1 6 6 1 24 36 14 1 120 240 150 30 1 + X 4

  8. + X 3 1 2 1 6 6 1 24 36 14 1 120 240 150 30 1

  9. + X 2 1 2 1 6 6 1 24 36 14 1 120 240 150 30 1

  10. 1 2 1 6 6 1 24 36 14 1 120 240 150 30 1 1 1 1 1 3 1 1 6 7 1 1 10 25 15 1 HP(k,i) is always divisible by i! (number of ways of permuting the colors) HP(k,i) / i! = S(k,i) = Stirling number of the second kind

More Related