1. F(n) = F(n-1) + F(n-2) donde: F(0) = 0 F(1) = 1

Systems Architecture
7th Edition
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Stephen D. Burd
Chapter3: Data Representation
Section: Chapter Questions
Problem 13VE: A(n) __________ contains 8 __________.
icon
Related questions
Question

Derivate, substitute and present the pattern, where F(0) = 0 and F(1) = 1.

1.
F(n) = F(n-1) + F(n-2)
donde:
F(0) = 0
F(1) = 1
Transcribed Image Text:1. F(n) = F(n-1) + F(n-2) donde: F(0) = 0 F(1) = 1
Expert Solution
steps

Step by step

Solved in 2 steps with 7 images

Blurred answer
Recommended textbooks for you
Systems Architecture
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning