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⁻¹ ...
確定! 回上一頁