aboutsummaryrefslogtreecommitdiff
path: root/cyn/n7.lyx
diff options
context:
space:
mode:
authorJuan Marin Noguera <juan@mnpi.eu>2022-12-04 22:49:17 +0100
committerJuan Marin Noguera <juan@mnpi.eu>2022-12-04 22:49:17 +0100
commitc34b47089a133e58032fe4ea52f61efacaf5f548 (patch)
tree4242772e26a9e7b6f7e02b1d1e00dfbe68981345 /cyn/n7.lyx
parent214b20d1614b09cd5c18e111df0f0d392af2e721 (diff)
Oops
Diffstat (limited to 'cyn/n7.lyx')
-rw-r--r--cyn/n7.lyx10
1 files changed, 5 insertions, 5 deletions
diff --git a/cyn/n7.lyx b/cyn/n7.lyx
index 525fc3d..b4c7353 100644
--- a/cyn/n7.lyx
+++ b/cyn/n7.lyx
@@ -806,7 +806,7 @@ El máximo común divisor de
Demostración:
\series default
Sea
-\begin_inset Formula $d:=\text{mcd}(a_{1},\dots,a_{n})$
+\begin_inset Formula $d\coloneqq \text{mcd}(a_{1},\dots,a_{n})$
\end_inset
, como
@@ -814,7 +814,7 @@ Demostración:
\end_inset
, entonces
-\begin_inset Formula $d|(f:=\text{mcd}(a_{1},a_{2})),a_{3},\dots,a_{n}|e:=\text{mcd}(\text{mcd}(a_{1},a_{2}),a_{3},\dots,a_{n})$
+\begin_inset Formula $d|(f\coloneqq \text{mcd}(a_{1},a_{2})),a_{3},\dots,a_{n}|e\coloneqq \text{mcd}(\text{mcd}(a_{1},a_{2}),a_{3},\dots,a_{n})$
\end_inset
y por tanto
@@ -1735,7 +1735,7 @@ teorema
\end_inset
, el número
-\begin_inset Formula $N:=p_{1}\cdots p_{n}+1$
+\begin_inset Formula $N\coloneqq p_{1}\cdots p_{n}+1$
\end_inset
también lo es.
@@ -2127,7 +2127,7 @@ La ecuación
\end_inset
tiene solución si y sólo si
-\begin_inset Formula $d:=\text{mcd}(a,m)|b$
+\begin_inset Formula $d\coloneqq \text{mcd}(a,m)|b$
\end_inset
, y las soluciones son todos los enteros
@@ -2232,7 +2232,7 @@ x\equiv b_{k} & (m_{k})
\end_inset
tiene solución única módulo
-\begin_inset Formula $M:=m_{1}\cdots m_{k}$
+\begin_inset Formula $M\coloneqq m_{1}\cdots m_{k}$
\end_inset
.