Function fibo::fibo_mat_loop

pub fn fibo_mat_loop<T: Index>(n: T, m: T) -> T

Compute the n-th Fibonacci number modulo m using a Q-matrix with repeated squaring (using loops). Slightly faster than fibo_mat_req() since there are no function call overhead. The computation time is O(log(n)).