fast-fibonacci
Quickly find nth fibonacci number, with modulo.
Uses linear recurrence to find nth fibonacci number with modulo. O(log(n))
BigUint version of fib_with_mod. Uses linear recurrence to find nth fibonacci number with modulo. O(log(n))