Problem 52968. Easy Sequences 43: Least Common Fibonacci Number
Solution Stats
Problem 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 at 16:10
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 commentsProblem Recent Solvers5
Suggested Problems
-
Number of 1s in the Binary Representation of a Number
412 Solvers
-
193 Solvers
-
44 Solvers
-
286 Solvers
-
21 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!