- GCD: Step by step using the Euclidean Algorithm and the possibility to express it with Bezout Identity.
- Inverse Mod: Calculate the inverse in modulus: a⁻¹ mod n.
- Power Mod: Compute the solution to aᵇ mod n, step by step. Using Little Fermat Theorem or Binary when it's necessary.
9Apps 4.9
