Problem 45466. Fibonacci Word
F1='0'
F2='1'
F3 is the catenation of the previous two. So,
F3 = cat(F2,F1)='10'.
similarly,
F4 = cat(F3,F2)= '101'
Given a particular pattern p, find out how many times that pattern appears in the nth-fibonacci word.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers21
Suggested Problems
-
Back to basics 9 - Indexed References
438 Solvers
-
Set some matrix elements to zero
516 Solvers
-
Matlab Basics - Pick out parts of a vector
253 Solvers
-
Matlab Basics II - Extract last 3 elements of a vector
239 Solvers
-
Convert from Fahrenheit to Celsius
22610 Solvers
More from this Author165
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!