Add inverse
This commit is contained in:
parent
77467e3cca
commit
3c101b6967
1 changed files with 38 additions and 0 deletions
|
@ -331,4 +331,42 @@
|
|||
\bottomrule
|
||||
\end{tabularx}
|
||||
|
||||
\paragraph{Inverse}
|
||||
|
||||
\begin{equation*}
|
||||
\overline{a} \text{ est inversible dans } \frac{\mathbb{Z}}{n\mathbb{Z}} \iff \mathrm{pgcd}(a,n) = 1
|
||||
\end{equation*}
|
||||
|
||||
Ils sont donc premiers entre eux.
|
||||
En utilisant Bezout~:
|
||||
\begin{align*}
|
||||
\exists \, (u,v) \in \mathbb{Z} \, / \, au+nv = 1
|
||||
&\implies a[n] \times u[n] + n[n] \times v[n] = 1[n] \\
|
||||
&\implies a[n] \times u[n] = 1 \quad \text{ car } n[n] = 0 \\
|
||||
&\implies \overline{a} \otimes \overline{u[n]} = \overline{1} \\\\
|
||||
\overline{u[n]} \text{ est l'inverse de } \overline{a} \text{ dans } \frac{\mathbb{Z}}{n\mathbb{Z}}
|
||||
\left\{
|
||||
\begin{array}{l}
|
||||
\text{Si $u$ est positif, } u[n] = u \\
|
||||
\text{Si $u$ est négatif, } u[n] = u+n \\
|
||||
\end{array}
|
||||
\right.
|
||||
\end{align*}
|
||||
|
||||
Exemple~:
|
||||
|
||||
$\overline{7}$ est-il inversible dans $\frac{\mathbb{Z}}{15\mathbb{Z}}$~?
|
||||
\hfill
|
||||
\begin{tabularx}{0.5\linewidth}{YYY}
|
||||
\toprule
|
||||
r & u & q \\
|
||||
\midrule
|
||||
15 & 0 & \\
|
||||
7 & 1 & 2 \\
|
||||
1 & -2 & 7 \\
|
||||
0 & & \\
|
||||
\end{tabularx}
|
||||
|
||||
$u=-2$, $u+n = 13$ donc l'inverse de $\overline{7}$ est $\overline{13}$.
|
||||
|
||||
\end{document}
|
||||
|
|
Loading…
Reference in a new issue