Greetings: Good Morning Mrs Chong/teachers and fellow classmates.

Today I will be presenting my article critique on the Fibonacci Sequence, done by Kelvin Lim and Lawrence Li, published in the year 2008. (next slide) Overview: Fibonacci posed a famous problem about how fast rabbits would breed: Suppose a newly born pair of rabbits, one male and one female, are put in a field. Rabbits are able to mate at the age of 1 month so that at the end of its second month a female can produce another pair of rabbits. Suppose that the rabbits never die, and that the female always produces another pair of rabbits (1 male, 1 female) every month from the second month on. So, the Question was: How many pairs of rabbits will there be in a year? (next slide) As mentioned in the article, the Fibonacci Sequences are related to nature in some aspects. Some plants, as shown here in the slide, have a number of petals that add up to a Fibonacci number. (next slide) The Nautilus has a shell with the shape of an equiangular spiral, which is constructed by putting the squares of 2 consecutive Fibonacci numbers together, and drawing the spiral. I was quite thrilled to see the last part of the article as it stated a few identities regarding the Fibonacci Sequence. It shows how deeply studied the Sequence was. (next slide) Mathematical Concepts learnt: Studying a Sequence can allow one to analyse it deeply, hence finding trends, and patterns that may eventually lead to deriving a formula. This is especially true in the Fibonacci Sequence. Some of these identities may also help us find a selected term of the Fibonacci Sequence. (next slide) Things to be added on or improved on: The 2 authors did not add any proofs for the identities that they stated, which I think they could have added. If it is too hard to proof, or if it is too complicated, the authors could have chosen to use simpler identities. There are several methods of proofs include

(next slide)

1. Proof by contradiction 2. Proof by induction

Proof by Contradiction: Basically, Proof by Contradiction is a method to proof some proposition by showing that it were not true, there will be some contradiction. Therefore, the proposition can only be true, since something can only be true or false. (next slide) Example of Proof by Contradiction One such example is proving shall assume that to be irrational. By Proof by Contradiction, we in the

is rational, and can be expressed as a fraction

simplest form, where at least 1 of which is odd, and b Therefore, by cross-multiplication and squaring, we obtain: a2 = 2b2 Therefore, b must be odd. (next slide) But from the earlier equation,

It is a contradiction that b can be odd and even at the same time, therefore it is impossible for (next slide) Proof by induction: Suppose there is a statement that is true to all natural numbers. Proof by induction means that we first prove that the first statement is true, then prove that any one statement of the infinite sequence of the statements is true. (next slide) Example of Proof by induction: Proving the sum of consecutive natural numbers is easy using induction, although there are other ways of proving them as well. Firstly, we first prove that the first statement is true, in this case, letting n=0. This is true. (next slide) to be rational, that means must be irrational.

Then, we proceed to the inductive step. We first show that if P(k) holds, then P(k+1) hold as well. We can first assume that P(k) holds, so now we need to prove that P(k+1) holds. Which means proving this:

Applying the formula for P(k), we obtain the expression(point at the expression)

(next slide) So, we obtain:

Therefore, by mathematical induction, we have proven this formula. (next slide) Proofs of some Formulae- Binets Formula Looking at the complicated expression, it seems difficult to prove, but by using known facts and using simpler symbols to represent values, it is actually quite easy to prove. (the rest just read off the slide) (a lot of slides later) Proofs of some formulae-More Identities (read off the slide) (next slide) An interesting fact: One interesting fact is that when you have 2 consecutive Fibonacci numbers, the larger one divided by the smaller one, will get you closer and closer to the golden ratio as the numbers increase. (next slide)

What is the Golden Ratio?

This is the golden ratio. (next slide) What is the Golden Ratio? The reciprocal of the golden ratio is just subtracting 1 from itself. On the other hand, the square of the golden ratio is just adding 1 to itself. (next slide) How to draw the golden rectangle? Very simple. (read off slides) (many slides later)

This is a very special number, because: As you can see, the decimal places of the number are closely related to the Fibonacci numbers. By diagonally putting the last digit in 1 line, and then adding the numbers up, we obtain the decimal places of the number. (next slide) As you can see, Fibonacci Numbers also appear in Pascals Triangle, which is the sum of the numbers in a certain diagonal pattern. (next slide) Thank you very much for your attention! I truly hope you enjoyed this presentation!