Hey Alex!

Great job.

Based on your answers I made some challenge variations of these problems, where the number of steps is \\(10^{100}\\).

> All of these probably have much faster solutions of the form round(\\(c_0*c_1^n\\)), but I could use the haskell practice. Thanks for the puzzles!

Yeah, there's a solution like this. While it is cute, it's not numerically stable. There is also a similar solution that can be derived taking the \\(z\\)-transform.