Monday, August 28, 2017

A new look at Gaussian summation

Yesterday in my discrete math class, I had the opportunity to build to a summation formula in a slightly different manner than in the past. The class was working on finding the values of triangular numbers. Many students saw the recursive nature of the situation and realized that by simply adding consecutive integers they could calculate the value of a triangular number. They wanted to have a more efficient way to calculate but were not coming up with any ideas.

One student did come up with a way to calculate the result and had justification through manipulation of dot arrangements. The issue was how to get the rest of the class to a point where presenting this student's ideas would make sense.

I had an idea and decided to see where it would lead. I began by writing 1 + 2 + 3 + 4 + 5 + 6 + 7 on the board and asking students how they would add these in their head. Students are naturally inclined to form 10's as these are nice anchor values to use. Many students said they would add values 3 + 7 and 4 + 6 to get 10’s and then add the remaining values.

I then added an 8 into the mix and wrote out 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8. Students again made pairs to form 10’s. The issue is that the process changes in that different values are now being gathered up at the end. I asked the class if there was a consistent process that they could use when adding the values. A consistent process would enable us to find values of triangular numbers without having to think too much about how to do it.

At this point, several students noticed that adding 1 + 6 = 7, 2 + 5 = 7 and 3 + 4 = 7. The students said you could then multiply 3 x 7 and add the final 7 to get an answer. I wondered if this would work consistently and asked students to try it with 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9. Students did and said it worked. I pushed students to consider how this process worked. They realized that you subtract one from the last value and then multiply the last value by half the second to the last value. They basically thought of the process as (8/2) 9 + 9. The class said this was the same process when adding the integers 1-7.

I asked students to use this process to calculate T75. They readily did this without issue. I then wondered if the formula worked if there were an even number of values instead of an odd number of values. Students tried this and found it worked .

Now they had this part down, it was time to push them to finding a formula. I told the class I wanted to write out the series without having to specify what the final value actually is. I wrote out the sum like this: 1 + 2 + 3 + 4 + 5 + 6 + 7 + … + (n - 1) + n, where n is the final value. I asked students to use the process they were just using to calculate the value of Tn. Students were readily able to write out that Tn = n(n-1)/2 + n.

Students saw that there is no magic about where the formula comes from. Using their logic and processes, the formula was simply an extension of their thinking. It also demonstrates how the formula and math help make life easier by providing them a more efficient and effective way to calculate values of triangular numbers.

Students were now in a position to see a justification tied to the triangular number representation through dots. Besides providing a different way to approach developing a formula, the presentation of an alternative way to derive a formula provided an in to discuss the algebraic equivalence of formulas.

I was glad that I pursued this idea as it helped students build confidence and comfort with the math involved in our work with triangular numbers.

Wednesday, August 23, 2017

Starting up discrete math


The first few days of my discrete math class are rolling out as expected. Besides covering operational issues, the opening of the class pushes students to break their perception of what a math class looks like and how it operates.

I have been pleased with how responsive the class has been. When pushed to think of problems in new and different ways or to look for patterns and connections to physical representations, the class has really pushed themselves.

After working through some Pascal triangle investigations, we started working with figurate numbers. I opened with square numbers, as usual, to work on thinking of familiar entities differently. When we transitioned to triangular numbers, the class easily dove into working with the representations and patterns. The exciting part was that students saw how to calculate triangular numbers but wanted to have a more efficient way to perform the calculation. I'll be interested to see what processes and formulas they come up with.

For those interested, here is the table of contents from my discrete math ebook. You can get a sense of the material that is covered and how the course progresses through the topics.


Table of Contents

  1. Counting and Discrete Probability …………………………………………………….… page   3
    1. Initial Investigations ……………………………………..………………………… page  3
    2. Figurate Numbers ……………………………….………..………………………… page  4
    3. Finite Differences  ……………………………….………..………………………… page  7
    4. Polygonal Numbers ………..……………………………..………………………… page  9
    5. Combinations and Permutations  ……………………...……………………… page 10
    6. The Pigeonhole Principle  ……………………………………..…………………. page 12
    7. Advanced Counting ……………………………………..………………………..… page 13
    8. Discrete Probability ……………………………………..………..……………..… page 15
    9. Conditional Probability …………………………..……..………………………… page 17
    10. Probability Practice and Mastery Quiz ………………………………………. page 20
  2. Graph Theory  ……………………………………..…………………………………….……… page 21
    1. Introduction to Graphs ………………………………..…………………..……… page 21
    2. Graph Theorems ………...………………………………..………………………… page 27
    3. Mail Route Practice ……………..……………..………..………………………… page 31
    4. Hamilton Paths and Circuits …………..……………..………………………… page 32
    5. Planar Graphs …………….………………………………..………………………… page 35
    6. Complete and Complementary Graphs …………………………………….. page 39
    7. Graph Coloring ………………………………………..…..………………………… page 43
  3. Elementary Number Theory  ………..…………………………..………………………… page 50
    1. Prime Numbers …………………………..………………..………………………… page 50
    2. Prime Number Distribution ………...………………..………………………… page 53
    3. Prime Number Sequences ……………...……………..………………………… page 57
    4. Relative Primes ………..…………………………………..………………………… page 59
    5. Prime Sums …………………………………………..……..………………………… page 62
    6. Prime Factorization ……….……………………………..………………………… page 63
    7. Perfect Numbers ………………………...………………..………………………… page 66
    8. Mersenne Primes and Prime Formulas ……...…..………………………… page 69
    9. Euclidean Algorithm ………………………………..…..………………………… page 71
  4. Cryptography ……………………………………..…………………………………..………… page 74
    1. Caesar Ciphers ……………………...……………………..………………………… page 74
    2. Cipher Functions …………..……………………………..………………………… page 76
    3. Affine Ciphers …………………....………………………..………………………… page 80
    4. Chinese Remainder Theorem ……….………………..………………………… page 81
    5. Congruences ……………………………….………………..………………………… page 83
    6. Solving Congruences ……………………………………..………………………… page 88
    7. Congruences and Divisibility ………………..………..………………………… page 90
    8. Modular Arithmetic …………….………………………..………………………… page 93
    9. Primality Tests ……………………………………...……..………………………… page 95
    10. Cryptography Revisited ………………………………...………………………… page 97
    11. Diffie-Hellman Exchange ……….……………………..………………………… page 98
    12. Cracking the Diffie-Hellman Exchange ……………...…………………...… page 101
    13. RSA Protocol ……………………………...………………..………………………… page 103
    14. RSA Practice ………………………….……………………..………………………… page 105
  5. Set Theory and Boolean Algebra ……...………………………..………………………… page 108
    1. Understanding Sets ……………………..………………..………………………… page 108
    2. Set Operations ……………………………….……………..………………………… page 111
    3. Venn Diagrams ……………………………...……………..………………………… page 115
    4. DeMorgan’s Laws and Cartesian Products …………….…………………… page 116
    5. Boolean Algebra …………………………..………………..…………………..…… page 118
    6. Boolean Functions ……………….………………………..………………..……… page 120
    7. Boolean Identities ……………..…………………………..………………………… page 122
    8. Truth Tables ……………………………………..…………..……………..………… page 124
    9. Logic Gates ……………………………………………….…..……………………..… page 128
  6. Logic and Proof …………………………………………………….....…………………..…… page 132
    1. Statements and Negation ………………..……………..………………………… page 132
    2. The Language of Logic …………………………….……..………………..……… page 134
    3. Showing Truth …………………………….………………..………………………… page 136
    4. Methods of Proof ……………………...…………………..………………………… page 139