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
-
Replace NaNs with the number that appears to its left in the row.
2900 Solvers
-
The Hitchhiker's Guide to MATLAB
3245 Solvers
-
Number of 1s in a binary string
8184 Solvers
-
Set the array elements whose value is 13 to 0
1343 Solvers
-
Create a square matrix of zeros of even order
152 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!