The Fibonacci sequence's . item is and the . item is . Let be the amount of the first item's square in the Fibonacci sequence. Find .
(You have to use a calculator except you are a genious, but not more than two times!)
What is the Fibonacci sequence? If you don't know then read this wiki: The Fibonacci sequence
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
We will prove that a 1 2 + a 2 2 + a 3 2 + a 4 2 + ⋯ + a n − 1 2 + a n 2 = a n ∗ a n + 1 where a k is the k . item of the Fibonacci sequence. We will use Full induction. If n = 1 , then 1 = 1 ∗ 1 . Suppose for n = x the statement is true. We will prove that the statement is also true for n = x + 1 : Since a 1 2 + a 2 2 + ⋯ + a x 2 = a x ∗ a x + 1 , a 1 2 + a 2 2 + ⋯ + a x 2 + a x + 1 2 = a x ∗ a x + 1 + a x + 1 ∗ a x + 1 = a x + 1 ∗ ( a x + a x + 1 ) = a x + 1 ∗ a x + 2
Now we proved the statement.
The n + 2 . item of the sequence is 1 5 9 7 + 2 8 5 4 = 4 4 5 1 , so 1 2 + 1 2 + 2 2 + 3 2 + ⋯ + 1 5 9 7 2 + 2 8 5 4 2 = 2 8 5 4 ∗ 4 4 5 1 = 1 2 7 0 3 1 5 4 .
A nice representation mode for the solution ( f o r n = 5 ):
The rectangle's area is
a
n
+
1
∗
a
n
+
2
.