- 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
![How to find Mod Value (The Reminder) using Casio fx-991CW [Shortcut] #modulus #casio #casiofx991cw screenshot 4](https://i.ytimg.com/vi/4jwsXgICR3Q/mqdefault.jpg)
