Problem 52968. Easy Sequences 43: Least Common Fibonacci Number

Created by Ramon Villamangca

Solve Later

The Fibonacci sequence F is a series whose elements are numbers starting with  and , and subsequent Fibonacci numbers are defined recursively: . The first 20 Fibonacci numbers are:
                            
Given two indices n and m, write a program to return the least common Fibonacci number, , which is defined as the smallest Fibonacci number divisible by both  and . For example,, which is , since  and  both divide .
Since. the value of  may become large even if the values of n and m are relatively small, please output a vector containing the number of digits and the last 6 digits of . Therefore, in the example above the output of , which has 4 digits, should be .

Solve

Solution Stats

28 Solutions
5 Solvers

Last Solution submitted on May 03, 2025

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

GeeTwo on 7 Dec 2022

That's not really a standard way to number F(n), (usually F(0):==0 and F(1):==1) but OK...

James on 2 Jun 2023

It's numbered like that because the lowest Fibonacci number divisible by F(a) and F(b) in the normal numbering system is F(lcm(a,b)). In the example here, you need to add one to everything to get that to work: lcm((3+1),(4+1)) = (19+1)

Solution Comments

Show comments

Problem Recent Solvers5

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 52968. Easy Sequences 43: Least Common Fibonacci Number

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers5

Suggested Problems

More from this Author116

Problem Tags

Community Treasure Hunt

Problem 52968. Easy Sequences 43: Least Common Fibonacci Number

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers5

Suggested Problems

More from this Author116

Problem Tags

Community Treasure Hunt

Players