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
-
4192 Solvers
-
Find the numeric mean of the prime numbers in a matrix.
9159 Solvers
-
Project Euler: Problem 4, Palindromic numbers
1288 Solvers
-
interesting center of magic matrix
111 Solvers
-
Four digit number ABCD reversal
50 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!
