The Fibonacci numbers 1, 1, 2, 3, 5, 8, 13.. are defined by the recursion formula xn+1 = Xn + xn-1, whit x1 = 1.Prove that (xn, xn+1) = 1 and that xn (a" – b") /(a – b), where a and bare the roots of the quadratic equation x? – x – 1 = 0. X2 - -

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter5: Inverse, Exponential, And Logarithmic Functions
Section5.2: Exponential Functions
Problem 62E
icon
Related questions
Question
The Fibonacci numbers 1, 1, 2, 3, 5, 8, 13... are defined by
the recursion formula xn+1 = Xn + Xn-1,
whit
X1 =
1.Prove that (xn, Xn+1) = 1 and that xn
(a" – b") /(a – b), where a and bare the roots of the
quadratic equation x2 – x – 1 = 0.
X2
-
-
-
Transcribed Image Text:The Fibonacci numbers 1, 1, 2, 3, 5, 8, 13... are defined by the recursion formula xn+1 = Xn + Xn-1, whit X1 = 1.Prove that (xn, Xn+1) = 1 and that xn (a" – b") /(a – b), where a and bare the roots of the quadratic equation x2 – x – 1 = 0. X2 - - -
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Elementary Geometry For College Students, 7e
Elementary Geometry For College Students, 7e
Geometry
ISBN:
9781337614085
Author:
Alexander, Daniel C.; Koeberlein, Geralyn M.
Publisher:
Cengage,
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning