Result by tag 5 results
- Tips and tricks #9: Big numbers
How to use big number input and PCR library.
- Polynomial Greatest Common Divisor
The calculator gives the greatest common divisor (GCD) of two input polynomials.
- Extended Euclidean algorithm
This calculator implements Extended Euclidean algorithm, which computes, besides the greatest common divisor of integers a and b, the coefficients of Bézout's identity
- Modular Multiplicative Inverse
This calculator calculates modular multiplicative inverse of an given integer a modulo m
- The greatest common divisor of two integers
This calculator determines the greatest common divisor of two integers using Euclidean algorithm