Cody

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

38.46% Correct | 61.54% Incorrect
Last Solution submitted on Jun 14, 2020

Problem Recent Solvers10

Suggested Problems

More from this Author145

Problem Tags