4. Use the equality proven in question 3 to design an algorithm to compute the nth Fibonacci number in O(log n) time.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
100%

Need help with Question #4.

Question #3 has been provided as a sample reference with work.

Fn
(Fn+1
Fn-1.
3. Let Fn denote the nth Fibonacci number. Let.
Show that A" =
(Hint: use induction).
Given,
By Induction:
For n=1:
A =
F1+1
F1
A'=
To prove that,
F1
F1-1
- ( )
- (; :)-^
Fa+1
(F, Fn-1
F2 F1
F, Fo
A"
{:: F2 = 1, F1 = 1, and Fo = 0}
Therefore, A" is true for n = 1.
For n=k:
Assume that the given statement is true for n= k. Then we have
At = ("
- (*)
´F+1
Now to prove that The given statement is true forn = k+1 i.e.
F142 Fr+1
Ak+1
L.H.S.
Ak+l = Ak.A
- (":
F+1
F Fx-1
{:: by u sin g (1), and A is Given}
- ( )
- (
Fr+1 + Fr Fk+1 +0
Fz + Fx-1 Fx + 0
Fr+2 F+1
= R. H.S
F+1
Thus, A" is true for n = k + 1.
Hence, by the principle of mathematical induction, the given statement is
true for all natural numbers (n eN)..
Transcribed Image Text:Fn (Fn+1 Fn-1. 3. Let Fn denote the nth Fibonacci number. Let. Show that A" = (Hint: use induction). Given, By Induction: For n=1: A = F1+1 F1 A'= To prove that, F1 F1-1 - ( ) - (; :)-^ Fa+1 (F, Fn-1 F2 F1 F, Fo A" {:: F2 = 1, F1 = 1, and Fo = 0} Therefore, A" is true for n = 1. For n=k: Assume that the given statement is true for n= k. Then we have At = (" - (*) ´F+1 Now to prove that The given statement is true forn = k+1 i.e. F142 Fr+1 Ak+1 L.H.S. Ak+l = Ak.A - (": F+1 F Fx-1 {:: by u sin g (1), and A is Given} - ( ) - ( Fr+1 + Fr Fk+1 +0 Fz + Fx-1 Fx + 0 Fr+2 F+1 = R. H.S F+1 Thus, A" is true for n = k + 1. Hence, by the principle of mathematical induction, the given statement is true for all natural numbers (n eN)..
4. Use the equality proven in question 3 to design an algorithm to compute the nth Fibonacci
number in O(log n) time.
Transcribed Image Text:4. Use the equality proven in question 3 to design an algorithm to compute the nth Fibonacci number in O(log n) time.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 1 images

Blurred answer
Knowledge Booster
Time complexity
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education