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


No comments:

Post a Comment