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 comments
Loading...
Problem Recent Solvers26
Suggested Problems
-
Select every other element of a vector
37566 Solvers
-
Sort a list of complex numbers based on far they are from the origin.
5823 Solvers
-
443 Solvers
-
Find the maximum two numbers of every column of a matrix
236 Solvers
-
Replace odd number in given matrix by zero
151 Solvers
More from this Author174
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!