Institution: University of Ottawa
Category: Faculty of Science
Many interesting mathematics problems and many real-world applications can be formulated as recursions. A recursion tells you how to calculate the next number in a long sequence when one (or more) are given. One famous application is the Fibonacci sequence that describes how the number of rabbits grows from one month to the next. Another example is Collatz’ 3n+1 problem that asks whether a certain recursion will always contain the number 1, no matter with which number one starts. In this course, we will learn to solve some recursions, simulate others, and apply them to real-world problems.