1. “More Really Cool Things Happening in Pascal’s Triangle” Jim Olsen Western Illinois University

2. Outline 0.What kind of session will this be? 1.Review of some points from the first talk on Pascal’s Triangle and Counting Toothpicks in the Twelve Days of Christmas Tetrahedron 2.Two Questions posed. 3.Characterizations involving Tower of Hanoi, Sierpinski, and _______ and _______. 4.A couple more interesting characterizations. 5.Two Questions solved.

3. 0. What kind of session will this be? This session will be less like your typical teacher in-service workshop or math class. Want to look at some big ideas and make some connections. I will continually explain things at various levels and varying amounts of detail. Resources are available, if you want more. Your creativity and further discussion will connect this to lesson planning, NCLB, standards, etc.

4. 1.Review Triangular numbers (Review)

5. +3 1 +2 +9 +8 +7 +6 +5 +4 Let’s Build the 9 th Triangular Number (Review)

6. n n+1 n(n+1) Take half. Each Triangle has n(n+1)/2 (Review)

7. Another Cool Thing about Triangular Numbers Put any triangular number together with the next bigger (or next smaller). And you get a Square!

8. Eleven Characterizations Char. #1: First Definition: Get each number in a row from the two numbers diagonally above it (and begin and end each row with 1). This is the standard way to generate Pascal’s Triangle. (Review)

9. Char. #2: Second Definition: A Table of Combinations or Numbers of Subsets (Characterization #1 and characterization #2 can be shown to be equivalent) Char. #3: Symmetry (Review)

11. Char. #4: The total of row n = the Total Number of Subsets (from a set of size n) = 2 n (Review)

12. Char. #5: The Hockey Stick Principle (Review)

13. Char. #6: The first diagonal are the “stick” numbers. Char. #7: second diagonal are the triangular numbers. (Review)

14. Char. #8: The third diagonal are the tetrahedral numbers. (Review)

15. A Fun Way to Count the Toothpicks in the 12 Days of Christmas Tetrahedron Organize the marshmallows (nodes) into categories, by the number of toothpicks coming out of the marshmallow. What are the categories? (Review)

16. This double counts, so there are 1716 toothpicks! Category of Nodes Number of Nodes Number of Toothpicks from each Product Corners4312 Edges 6x106360 Faces 4xT 9 91620 Interior Te 8 121440 Total: 3432 But….

17. The numbers in row n are the number of different ways a ball being dropped from the top can get to that location. Row 7 >> 1 7 21 35 35 21 7 1 Char.#9: This is actually a table of permutations (permutations with repetitions). Char. #10: Imagine a pin at each location in the first n rows of Pascal’s Triangle (row #0 to #n-1). Imagine a ball being dropped from the top. At each pin the ball will go left or right.

18. Char. #11: The fourth diagonal lists the number of quadrilaterals formed by n points on a circle. (Review)

19. 2. Two Questions posed 1.What is the sum of the squares of odd numbers (or squares of even numbers)? 2.What is the difference of the squares of two consecutive triangular numbers?

20. 3. Characterizations involving Tower of Hanoi, Sierpinski, and _______ and _______. Solve Tower of Hanoi. What do we know? Brainstorm. http://www.mazeworks.com/hanoi/index.htm

21. Solutions to Tower of Hanoi Disks Moves Needed Sequence 11a 23aba 37aba c aba 415aba c aba D aba c aba 531aba c aba D aba c aba E aba c aba D aba c aba

22. Characterization #12 The sum of the first n rows of Pascal’s Triangle (which are rows 0 to n-1) is the number of moves needed to move n disks from one peg to another in the Tower of Hanoi. Notes: The sum of the first n rows of Pascal’s Triangle (which are rows 0 to n-1) is one less than the sum of the n th row. (by Char.#4) Equivalently:

23. Look at the Sequence as the disks Disks Moves Needed Sequence 23aba

24. Look at the Sequence as the disks Disks Moves Needed Sequence 37aba c aba What does it look like?

25. Look at the Sequence as the disks A ruler!

26. Solutions to Tower of Hanoi Can you see the ruler markings? Disks Moves Needed Sequence 11a 23aba 37aba c aba 415aba c aba D aba c aba 531aba c aba D aba c aba E aba c aba D aba c aba

27. Solution to Tower of Hanoi Ruler Markings

28. What is Sierpinski’s Gasket? http://www.shodor.org/interactivate/activities/gasket/ It is a fractal because it is self-similar.

29. More Sierpinski Gasket/Triangle Applets and Graphics http://howdyyall.com/Triangles/ShowFrame/ShowGif.cfm http://www.arcytech.org/java/fractals/sierpinski.shtml by Paul Bourke

30. Vladimir Litt's, seventh grade pre-algebra class from Pacoima Middle School Pacoima, California created the most amazing Sierpinski Triangle. http://math.rice.edu/%7Elanius/frac/pacoima.html

31. Characterization #13 If you color the odd numbers red and the even numbers black in Pascal’s Triangle, you get a (red) Sierpinski Gasket. http://www.cecm.sfu.ca/cgi-bin/organics/pascalform

32. Characterization #14 Sierpinski’s Gasket, with 2 n rows, provides a solution (and the best solution) to the Tower of Hanoi problem with n disks. At each (red) colored node in Sierpinski’s Gasket assign an n-tuple of 1’s, 2’s, and 3’s (numbers stand for the pin/tower number). The first number in the n-tuple tells where the a-disk goes (the smallest disk). The second number in the n-tuple tells where the b- disk goes (the second disk). Etc.

33. Maybe we should call it Sierpinski’s Wire Frame The solution to Tower of Hanoi is given by moving from the top node to the lower right corner.

35. Solution to Tower of Hanoi Sierpinski Wire Frame Ruler Markings

36. …But isn’t all of this Yes/No…..On/off Binary Base Two

37. Characterization #12.1 The sum of the first n rows of Pascal’s Triangle (which are rows 0 to n-1) is the number of non-zero base-2 numbers with n digits. 1 Digit 2 Digits 3 Digits 11 10 11 1 10 11 100 101 110 111 Count in Base-2

38. 1 10 11 100 101 110 111 1000 1001 1010 1011 1100 1101 1110 1111 What Patterns Do You See? How can this list be used to solve Tower of Hanoi?

39. Binary Number List Solves Hanoi Using the list of non-zero base-2 numbers with n digits. When: The 2 0 (rightmost) number changes to a 1, move disk a (smallest disk). The 2 1 number changes to a 1, move disk b (second smallest disk). The 2 2 number changes to a 1, move disk c (third smallest disk). Etc. a b a C a b a 3 Digits 1 10 11 100 101 110 111

40. Solution to Tower of Hanoi Sierpinski Wire Frame 1 10 11 100 101 110 111 Binary Numbers Ruler Markings

41. 4. A Couple More Interesting Characterizations.

42. Characterization #15 By adding up numbers on “diagonals” in Pascal’s Triangle, you get the Fibonacci numbers. This works because of Characterization #1 (and the fact that rows begin and end with 1).

43. Characterization #16 To get the numbers in any row (row n), start with 1 and successively multiply by For example, to generate row 6. 1 1615201561

44. 5. Two Questions Answered 1.What is the sum of the squares of odd numbers (or squares of even numbers)? Answer: A tetrahedron. In fact, or See Model.

45. Two Questions Answered (cont.) 2.What is the difference of the squares of two consecutive triangular numbers? Answer: A cube. In fact, n 3. See Model.

46. More Information http://www.wiu.edu/users/mfjro1/wiu/tea/pascal-tri.htm

47. Jim Olsen Western Illinois University jr-olsen@wiu.edu faculty.wiu.edu/JR-Olsen/wiu/ Thank you.