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:
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 
.
, 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 
.
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 .Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers7
Suggested Problems
-
1363 Solvers
-
4573 Solvers
-
Project Euler: Problem 10, Sum of Primes
2127 Solvers
-
We love vectorized solutions. Problem 1 : remove the row average.
895 Solvers
-
Find out missing number from a vector of 9 elements
322 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
That's not really a standard way to number F(n), (usually F(0):==0 and F(1):==1) but OK...
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)