x 44 x AB x 42 Coreioniam Bt IAW MearboolS NOTH Disereke Mathematics: Acrons the x 41 x 40, oF Discrete Mathematic: An Exciting and Necessary Addition to the Secondary School Curriculum Eric W. HartAN EXCITING, NECESSAR WHAT DISCRETE MATHEMATICS IS NOT ~DISCRETE MATHEMATICS ACROSS THE CURRICULUM, K-12 ‘equires an algorithm that ing. This is an exemple of algorithmic fone knows an efficient algorithm that |, but certain algorithms that can well in most cases. 1 solve this type of problem in and used will work ‘Combinatorics Combinatories ig the mathem: cerned with problems that inv atiempts to answer one or more of the following questions; Many problems in graph theory saph-coloring example above is also a comb he minimum, or optimum, number of colors ne goal is to ‘example is the problem of Here the three crucial questions are these: © Does a path exist © How many © Is there an optimum path? ns are there? ‘The most familiar combinatoric problems are those de: nations and Less fa and the 7 as a sum of po are2+2+2 her of elements in each four-way inversec- ad can be used t0 solve a variety of problems, path between two vertices in a graph, * Difference Equations -Aadifferenceseqy the process of defining somet n.is an equation inyolving recursion. Recu! fig if erdis of iself in a spiral of money in. an previous year, the spiral stops at the i le at time zero. at describes this situation is A(n) = (1 + A(x — 1), where ris the annual interest An) is the amon ind A(n ~ 1) is the amount after (2 ~ weed to include the initial deposit to indi 1e whole process, say A(0) = $100. Th c equation because of the recursion involved, and A(O) is ealted ion. This example shows that difference equations are not ymething new; they are just being studied now more explicitly. Note that terms recurrence rel ad of difference equ. ference equations can he classified in am loyois to differ- 1 equations. For example, the equation A(n) = (+ r)A(n = 1) is lied a “first-order homogeneous linear equation.” First order refers to the that A(t) depends only on A(t — 1) and not on any further terms like A(n = 2). Homogeneous and linear mean that the right-hand side is a constant multiple of Ad — 8) her te ‘A solution to a difference equation is a fun n. Sometimes, but not always, there is a solution. Considering the difference cquation above, A(n) = (1 + NAC ~ 1), the closed-form solution is A(k) = A) + 9) This solu can be found by compu ues of mand looking for @ to the classification of in the account after # years, years. We point for acteristic of the real world. 7 ange are calculus and ht of as discrete’ anatogs ange is an essenti used to deseribe Difference equations hout having, jumerated