Spent 10 minutes scratching my head before finally working out how to enable complex numbers on my new Casio calculator.
Just about finished this book off, but I thought I’d add this article from my notes. It concerns page 35 which involves proving the conjecture that Fn+1/Fn –>Φ as n –> ∞ where Fn is the nth number in a Fibonacci sequence.
Reading through MS221 and had a struggle getting my head around question 5.2c. Here is my solution.