Welcome to the new platform of Programmers Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use it's exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.
I really need your help to write this !!
-Using loop constructs, finds the m th and n th Fibonacci numbers fm and fn (do NOT
MATLAB functions; do NOT utilize arrays).
3. Finds the greatest common divisor of fm and fn, by making use of loop constructs
(do NOT use builtin
functions for finding the GCD or factoring the numbers; do
not utilize arrays; use of basic functions such as MOD(), REM(), FLOOR(), etc.
4. Determines whether the GCD value is another Fibonacci number fk. If so, prints
the k value on the screen, if not, displays