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

51 Solutions

23 Solvers

Last Solution submitted on Jan 17, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers23

George Berken David Hill Ramon Villamangca Christian Schröder

Suggested Problems

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!