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
-
6733 Solvers
-
Maximum running product for a string of numbers
2075 Solvers
-
828 Solvers
-
341 Solvers
-
Convert from Fahrenheit to Celsius
21669 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!