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
-
Solve the set of simultaneous linear equations
513 Solvers
-
Make an awesome ramp for a tiny motorcycle stuntman
786 Solvers
-
Calculate distance travelled when given radius and rotations
243 Solvers
-
interesting center of magic matrix
111 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2241 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!