Problem 45466. Fibonacci Word

• Created by Asif Newaz
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Magic Numbers IV

• 20 Problems
• 24 Finishers

Project Euler IV

• 11 Problems
• 16 Finishers

Like (2)

Difficulty:

(17)

Rate

• Solve Later   
• Add To GroupÂ

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

• 49 Solutions
• 21 Solvers

Last Solution submitted on Nov 22, 2022

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers21

Suggested Problems

• Is the Point in a Circle?

  617 Solvers

• Find the index of n in magic(n)

  255 Solvers

• Squaring Matrix

  674 Solvers

• Remove the positive integers.

  260 Solvers

• Matlab Basics II - Create a vector with a repeated entry

  241 Solvers

More from this Author165

• Kolakoski Sequence

  13 Solvers

• Tell your secret

  12 Solvers

• Magic Matrix

  8 Solvers

• Knight's Watch

  10 Solvers

• GCD

  29 Solvers