6.3		Difference equations, discrete dynamical systems and fractals

Vectors Point Toward Pisa, Richard A. Dean, 2:2, 1971, 28-39, 4.3
A General Formula for the Nth Term of a Sequence, Etta Mae Whitton, 2:2, 1971, 96-98, 5.4.1
Telescoping Sums and the Summation of Sequences, G. Baley Price, 4:2, 1973, 16-29, 5.4.2
Stirling's Triangle of the First KindÑAbsolute Value Style, Hugh Ouellette and Gordon Bennett, 8:4, 1977, 195-202, 0.2
Stirling's Numbers of the Second KindÑProgramming Pascal's and Stirling's Triangles, Satish K. Janardan and Konanur G. Janardan, 9:4, 1978, 243-248, 0.2
Binary Grids and a Related Counting Problem, Nathan Hoffman, 9:4, 1978, 267-272, 3.1
Summation of Finite SeriesÑA Unified Approach, Shlomo Libeskind, 12:1, 1981, 41-50, 5.4.2
Sequences, Series, and Pascal's Triangle, Lenny K. Jones, 14:3, 1983, 253-256, C, 5.4.2, 9.2
Pascal's Triangle, Difference Tables and Arithmetic Sequences of Order N, Calvin Long, 15:4, 1984, 290-298, 3.2, 5.4.1, 9.2
The Factorial Triangle and Polynomial Sequences, Steven Schwartzman, 15:5, 1984, 424-426, C, 0.2, 5.4.1
A Discrete Look at 1 + 2 + ... + n, Loren C. Larson, 16:5, 1985, 369-382, 0.2, 0.9, 3.1, 3.2, 5.4.2
The Pascal Polytope: An Extension of Pascal's Triangle to N Dimensions, John F. Putz, 17:2, 1986, 144-155, 3.2, 5.4.1, 9.2
Generating Functions, William Watkins, 18:3, 1987, 195-211, 5.4.2, 9.3
Fibonacci Numbers and Computer Algorithms, John Atkins and Robert Geist, 18:4, 1987, 328-336, 5.1.4, 8.1
Two Simple Recursive Formulas for Summing 1^k + 2^k + ... + n^k, Michael Carchidi, 18:5, 1987, 406-409, C, 5.2.1
Powers and Roots by Recursion, Joseph F. Aieta, 18:5, 1987, 411-416, 0.2, 0.7
Elementary Transcendental Functions, Harley Flanders and J. Sutherland Frame, 18:5, 1987, 417-421, 5.3.3
Pseudorandom Number Generators and a Four-Bit Computer System, James C. Reber, 20:1, 189, 54-55, C, 9.3, 9.10
Spreadsheets, Power Series, Generating Functions, and Integers, Donald R. Snow, 20:2, 1989, 143-152, 5.4.2
The Eternal TriangleÑa History of a Counting Problem, Mogens Esrom Larsen, 20:5, 1989, 370-384, 3.2
A Hidden Case of Negative Amortization, Bert K. Waits and Franklin Demana, 21:2, 1990, 121-126, 0.8
A Chaotic Search for i, Gilbert Strang, 22:1, 1991, 3-12, 5.1.3, 9.5
Discrete Dynamical Modeling, James T. Sandefur, 22:1, 1991, 13-22, 9.10
The Orbit Diagram and the Mandelbrot Set, Robert L. Devaney, 22:1, 1991, 23-38, 9.10
Theory vs. Computation in Some Very Simple Dynamical Systems, Larry Blaine, 22:1, 1991, 42-44, C, 9.10
Chaotic Mappings and Probability Distributions, Paul C. Matthews and Steven H. Strogatz, 22:1, 1991, 45-47, 7.2
The Root-Finding Route to Chaos, Richard Parris, 22:1, 1991, 48-55, 5.4.1, 9.5
Sofware Review: Chaos and Fractal Software, Jonathan Choate, 22:1, 1991, 65-69, 6.7, 9.5
Commutativity of Polynomials, Shmuel Avital and Edward Barbeau, 23:5, 1992, 386-395, 0.2, 0.7
Fibonacci Numbers, Recursion, Complexity, and Induction Proofs, Elmer K. Hayashi, 23:5, 1992, 407-410, C
Investigation of a Recurrence Relation: Student Research Project, Dmitri Thoro and Linda Valdes, 25:4, 1994, 322-324, 3.2, 9.3
The Dynamics of Newton's Method for Cubic Polynomials, James A. Walsh, 26:1, 1995, 22-28, 5.1.3
Can We See the Mandelbrot Set?, John Ewing, 26:2, 1995, 90-99, 9.5
A Geometric Approach to Linear Functions, Jack E. Graver, 26:5, 1995, 389-394, C, 0.2, 0.4
Bargaining Theory, or Zeno's Used Cars, James C. Kirby, 27:4, 1996, 285-286, C, 5.4.2
A Recurrence Relation in the Spinout Puzzle, Robert C. Lamphere, 27:4, 1996, 286-289, C
Fractals in Linear Algebra, James A. Walsh, 27:4, 1996, 298-304, 4.4
How Chaotic Things Work, William C. Mercier, 28:2, 1997, 110-118
Fibonacci Powers and a Fascinating Triangle, Dale K. Hathaway and Stephen L. Brown, 28:2, 1997, 124-128, C, 3.3, 9.3
A Continuous Version of Newton's Method, Steven M. Hetzler, 28:5, 1997, 348-351, 5.1.3
Studying the Cantor Dust at the Edge of Feigenbaum Diagrams, Aaron Klebanoff and John Rickert, 29:3, 1998, 189-198
A Simple Decision Rule for a Guessing Game, Luiz Felipe Martins, 29:5, 1998, 371-375, 7.1
Candies and Dollars, Saad M. Adnan, 29:5, 1998, 414-415, C
Will the Real Bifurcation Diagram Please Stand Up!, Chip Ross and Jody Sorensen, 31:1, 2000, 2-14
Binomials to Binomials, Thomas Osler, 31:3, 2000, 211-212, C, 0.2
The Orbits of a Unimodular Affine Transformation, Roman W. Wong, 31:4, 2000, 290-296, 4.4
Centering, Jim Sauerberg and Alan Tarr, 33:1, 2002, 24-31, 0.4, 3.3
Clarifying Compositions with Cobwebs, Nial Neger and Michael Frame, 34:3, 2003, 196-204, 0.2
Recirculation Models, Homogenized Milk, and Biotech Applications, Mark Bailey, Mike Hilgert, and Herb Bailey, 35:4, 2004, 283-288, 9.10
Phoebe Floats!, Ezra Brown, 36:2, 2005, 114-122, 2.2, 9.6
The Golden Ratio-A Contrary Viewpoint, Clement Falbo, 36:2, 2005, 123-134, 0.3
M&m Sequences, Harris S. Shultz and Ray C. Shiflett, 36:3, 2005, 191-198, 9.3

Truck Drivers, a Straw, and Two Glasses of Water, Kevin Iga and Kendra Kilpatrick, 37:2, 2006, 82-92, 0.2
NewtonÕs Method and the Wada Property: A Graphical Approach, Michael Frame and Nial Neger, 38:3, 2007, 192-204, 9.5, 9.7
Centaurs: Here, There, Everywhere!, Dimitri Dziabenko and Oleg Ivrii, 39:4, 2008, 267-272, 9.3, 9.5
The Truck DriverÕs Straw Problem and Cantor Sets, Kevin Iga, 39:4, 2008, 280-290