Skip to content

Commit 52e3679

Browse files
authored
Add CRT relationship between Bézout and inverses
1 parent 94eda35 commit 52e3679

File tree

1 file changed

+2
-0
lines changed

1 file changed

+2
-0
lines changed

src/algebra/chinese-remainder-theorem.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -52,6 +52,8 @@ We want to find a solution for $a \pmod{m_1 m_2}$. Using the [Extended Euclidean
5252

5353
$$n_1 m_1 + n_2 m_2 = 1$$
5454

55+
Equivalently, $n_1 m_1 \equiv 1 \pmod{m_2}$ so $n_1 \equiv m_1^{-1} \pmod{m_2}$, and vice versa $n_2 \equiv m_2^{-1} \pmod{m_1}$.
56+
5557
Then a solution will be
5658

5759
$$a = a_1 n_2 m_2 + a_2 n_1 m_1$$

0 commit comments

Comments
 (0)
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