Mudular Multiplicative Inverse

There's a total of 1 articles.

Extended Euclidean Algorithm

Published on Tue, Jun 2, 2015 - Last modified on Sun, Jun 16, 2024 - 814 words - Page Source

math number theory divisibility modulo linear congruence equations mudular multiplicative inverse extended euclidean algorithm euclidean algorithm diophantine equations
Extended Euclidean Algorithm
The extended euclidean algorithm finds solutions to the equation $ax + by = gcd(a, b)$ where $a, b$ are unknowns. This article covers a few applications of the extended euclidean algorithm like finding the modular multiplicative inverse of a number, and finding solutions for linear congruence equations.