From 6426ed348e31fd95cba7d99a30276230b35fbcb2 Mon Sep 17 00:00:00 2001
From: Andrew Guschin <guschin.drew@gmail.com>
Date: Tue, 25 Oct 2022 18:03:02 +0400
Subject: =?UTF-8?q?=D0=94=D0=BE=D0=B1=D0=B0=D0=B2=D0=BB=D0=B5=D0=BD=D0=B0?=
 =?UTF-8?q?=20=D0=B2=D1=82=D0=BE=D1=80=D0=B0=D1=8F=20=D0=BB=D0=B5=D0=BA?=
 =?UTF-8?q?=D1=86=D0=B8=D1=8F=20=D0=BF=D0=BE=20=D0=BA=D1=80=D0=B8=D0=BF?=
 =?UTF-8?q?=D1=82=D0=B5?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 cryptography/lectures/lecture3.tex | 2 --
 1 file changed, 2 deletions(-)

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

diff --git a/cryptography/lectures/lecture3.tex b/cryptography/lectures/lecture3.tex
index 9ace74a..04b84db 100644
--- a/cryptography/lectures/lecture3.tex
+++ b/cryptography/lectures/lecture3.tex
@@ -1,6 +1,4 @@
 % Лекция 3 (19.09.22)
-\subsection{Алгебраические структуры}
-
 Множество $R$ с двумя бинарными ассоциативными операциями сложения <<$+$>> и умножения
 <<$\cdot$>> называется \textbf{кольцом}, если выполнены следующие условия:
 \begin{enumerate}
-- 
cgit v1.2.3

