Tower of Hanoi-Mathematical Induction #10

In this project, I learned how to do mathematical induction. It was difficult to get all the numbers from the rings, because my screen kept freezing, but when I did get them, I did not realize how many moves it took to complete each step. I decided to move the first ring to the ring beside it because that was the only available place. For me, this game just seemed to be to put the ring wherever it fit, there was not rhyme or reason. Mathematical induction helped us to prove that the equation we came up with for the project was true, because when we plugged in certain variables, they worked. Step one proved that n=1 which was helpful, because we then knew we were on the right track. In step two, we proved that (k+1) was true, therefore proving that our entire equation was true and proven correct. I learned that the recursion formula can be very helpful in terms of plugging in that set for a longer part of the equation. We know that using mathematical induction can help prove something, because if we plug a 1 into each side and they come out equal, then our equation is correct.