Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
58 views1 page

Fibonacci Sequence: F F F F F N F F

The document presents a problem set from Keith Devlin's 'Introduction to Mathematical Thinking' focusing on the Fibonacci sequence. It states a theorem that the sum of the first n Fibonacci numbers equals Fn+2 and provides a proof by induction. The proof verifies the theorem for n = 1 and shows that if it holds for n, it also holds for n + 1, completing the argument.

Uploaded by

ishanth.satheesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
58 views1 page

Fibonacci Sequence: F F F F F N F F

The document presents a problem set from Keith Devlin's 'Introduction to Mathematical Thinking' focusing on the Fibonacci sequence. It states a theorem that the sum of the first n Fibonacci numbers equals Fn+2 and provides a proof by induction. The proof verifies the theorem for n = 1 and shows that if it holds for n, it also holds for n + 1, completing the argument.

Uploaded by

ishanth.satheesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

KEITH DEVLIN: Introduction to Mathematical Thinking Problem Set 7

QUESTION 5

The Fibonacci sequence is defined iteratively by setting F1 = F2 = 1 and thereafter letting Fn+2 =
Fn + Fn+1 .

Theorem For any natural number n,


n
X
Fk = Fn+2
k=1

Proof: By induction.

For n = 1, the left-hand side is F1 = 1 and the right-hand side is F2 = 1, so the identity is valid for
n = 1.

Assume the identity holds for n. Then:


n+1
X n
X
Fk = Fk + Fn+1
k=1 k=1

= Fn+2 + Fn+1 , by the induction hypothesis

= Fn+3 , by the definition of Fn+3

which is the identity for n + 1. The proof is complete.

You might also like