Recursion and Matrices
Many sequences of numbers can be described recursively. Probably the most famous of these is the Fibonacci sequence: 0, 1, 1, 2, 3, 5, 8,.... In this course, participants will explore these recursive sequences and develop tools for analyzing them. The development of these tools will take participants into a deep dive into the study of matrices and their many applications.
What happens when you multiply matrices repeatedly and how does that connect to recursive sequences of numbers? The course will investigate questions like these, tying them to the precollege mathematics curriculum. No prior background is necessary; the contexts and methods developed in the course will be low-threshold, high-ceiling, with plenty of interesting mathematics for any grade level.
NOTE: To open PDF files use Adobe Acrobat Reader, available free from Adobe:
