Documentation

sqrti returns two integer (l,b) so that l <= sqrt i <= b the implementation is quite naive, use an approximation for the first number and use a dichotomy algorithm to compute the bound relatively efficiently.

get the extended GCD of two integer using integer divMod

gcde a b find (x,y,gcd(a,b)) where ax + by = d

get the extended GCD of two integer using the extended binary algorithm (HAC 14.61) get (x,y,d) where d = gcd(a,b) and x,y satisfying ax + by = d

check if a list of integer are all even