The extended Euclidean algorithm returns the Bézout coefficients where a·x + m·y = gcd(a, m); when gcd = 1, x (mod m) is the inverse. Pure functions (extendedGcd, modInverse) are covered by headless ...

This repository contains a collection of number theory algorithms implemented in Racket including RSA, with a focus on primality testing, modular arithmetic, and Carmichael numbers - ...