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 Solvers24
Suggested Problems
-
4502 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
589 Solvers
-
Create a vector whose elements depend on the previous element
797 Solvers
-
Replace multiples of 5 with NaN
470 Solvers
-
Convert a Cell Array into an Array
2301 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!
