From c7f8b0f368a94ab19d528411c72f4b81c15cca71 Mon Sep 17 00:00:00 2001 From: jxu <7989982+jxu@users.noreply.github.com> Date: Mon, 16 Jan 2023 22:34:04 -0500 Subject: [PATCH] Link extended Euclidean algorithm to site article --- src/algebra/module-inverse.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/algebra/module-inverse.md b/src/algebra/module-inverse.md index b17b7af78..f18def09b 100644 --- a/src/algebra/module-inverse.md +++ b/src/algebra/module-inverse.md @@ -28,7 +28,7 @@ Consider the following equation (with unknown $x$ and $y$): $$a \cdot x + m \cdot y = 1$$ This is a [Linear Diophantine equation in two variables](linear-diophantine-equation.md). -As shown in the linked article, when $\gcd(a, m) = 1$, the equation has a solution which can be found using the [extended Euclidean algorithm](http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm). +As shown in the linked article, when $\gcd(a, m) = 1$, the equation has a solution which can be found using the [extended Euclidean algorithm](extended-euclid-algorithm.md). Note that $\gcd(a, m) = 1$ is also the condition for the modular inverse to exist. Now, if we take modulo $m$ of both sides, we can get rid of $m \cdot y$, and the equation becomes: pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy