Given two numbers M and N, the task is to check if the M-th and N-th Fibonacci numbers perfectly divide each other or not.
Input: M = 3, N = 6
F(3) = 2, F(6) = 8 and F(6) % F(3) = 0
Input: M = 2, N = 9
A naive approach will be to find the N-th and M-th Fibonacci numbers and check if they are perfectly divisible or not.
An efficient approach is to use the Fibonacci property to determine the result. If m perfectly divides n, then Fm also perfectly divides Fn, else it does not.
Exception: When N is 2, it is always possible as Fibo2 is 1, which divides every other Fibonacci number.
Below is the implementation of the above approach:
Time Complexity: O(1).
- An efficient way to check whether n-th Fibonacci number is multiple of 10
- How to check if a given number is Fibonacci number?
- Number of ways to represent a number as sum of k fibonacci numbers
- Finding number of digits in n'th Fibonacci number
- Nth Even Fibonacci Number
- Nth XOR Fibonacci number
- Fibonacci number in an array
- Find the next fibonacci number
- Program to find Nth odd Fibonacci Number
- n'th multiple of a number in Fibonacci Series
- Nth Fibonacci number using Pell's equation
- Find the previous fibonacci number
- Python Program for n-th Fibonacci number
- Count the nodes whose sum with X is a Fibonacci number
- Fibonacci Number modulo M and Pisano Period
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.