Home > Grinder > use the pulverizer to find the inverse of 13 modulo 23 in the interval 1 23

use the pulverizer to find the inverse of 13 modulo 23 in the interval 1 23

Euclidean algorithm - Wikipedia, the free encyclopedia

In mathematics, the Euclidean algorithm [a], or Euclid's algorithm, is a method for computing the greatest common divisor (GCD) of two (usually positive) integers ...