Solve the problem.In how many ways can you exactly cover the last two diagrams with "dominoes" that are just the size of two small squares?Use inductive reasoning to investigate the number of ways that a 2 × n strip can be exactly covered with "dominoes".[Hint: consider the Fibonacci numbers F1 = 1, F2 = 1, F3 = 2, F4 = 3, F5 = 5, F6 = 8, F7 = 13, . . . ]

Question

A. 10 ways; 28 ways
The number of ways that a 2 × n strip can be exactly covered with "dominoes" is given by 
B. 8 ways; 34 ways
The number of ways that a 2 × n strip can be exactly covered with "dominoes" is given by the Fibonacci number F_n
C. 8 ways; 34 ways
The number of ways that a 2 × n strip can be exactly covered with "dominoes" is given by the Fibonacci number F_n+1
D. 9 ways; 15 ways
The number of ways that a 2 × n strip can be exactly covered with "dominoes" is given by 2n - 1

Answer 1

Answer: C