From b9a9c52db5e76fd7163178a23bce7ae6fe7228f1 Mon Sep 17 00:00:00 2001
From: Andrew Guschin <guschin.drew@gmail.com>
Date: Mon, 7 Nov 2022 13:54:05 +0400
Subject: =?UTF-8?q?=D0=98=D1=81=D0=BF=D1=80=D0=B0=D0=B2=D0=BB=D0=B5=D0=BD?=
 =?UTF-8?q?=D0=B8=D1=8F=20=D0=B2=20=D0=BB=D0=B5=D0=BA=D1=86=D0=B8=D1=8F?=
 =?UTF-8?q?=D1=85=20=D0=B4=D0=BE=20=D0=BA=D0=BE=D0=BD=D1=82=D1=80=D0=BE?=
 =?UTF-8?q?=D0=BB=D1=8C=D0=BD=D0=BE=D0=B9?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 cryptography/lectures/lecture3.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'cryptography/lectures/lecture3.tex')

diff --git a/cryptography/lectures/lecture3.tex b/cryptography/lectures/lecture3.tex
index 04b84db..5abf6a2 100644
--- a/cryptography/lectures/lecture3.tex
+++ b/cryptography/lectures/lecture3.tex
@@ -152,7 +152,7 @@ $Z_m(t)$ представляющие собой набор всевозможн
 \begin{equation*}
   P(a_0, a_1, \dots, a_{n - 1}) = \prod_{i = 0}^{n - 1} P(x_i = a_i)
 \end{equation*}
-где $\forall i \in {0, 1, \dots, n - 1}$ и $\forall a \in Z_m P(x_i = a) >
+где $\forall i \in {0, 1, \dots, n - 1}$ и $\forall a \in Z_m : P(x_i = a) >
 0$ выполняется $\sum_{a \in Z_m} P(x_i = a) = 1$.
 
 Открытый текст такого источника является реализацией последовательности
-- 
cgit v1.2.3

