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.
Solve

Solution Stats

44.9% Correct | 55.1% Incorrect
Last Solution submitted on Nov 22, 2022

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers21

Suggested Problems

More from this Author165

Problem Tags

easy fibonacci sequence string

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!