Greatest common divisor naive algorithm and using Euclid,s lemma for faster algorithm by recursion of very high number. And also exploiting the relation between GCD and LCM in Python
Fibonacci number and it,s naive algorithm together with faster algorithm using memoization and iteration. And also it,s properties mainly Pisano period and it,s implementation in Python.