From 188a23495a28eade3f2043d60fc735e1d99ba193 Mon Sep 17 00:00:00 2001 From: erius Date: Tue, 17 Sep 2024 19:23:12 +0300 Subject: [PATCH] Started working on hw1 of probability theory --- probability-theory/hw/hw-template.typ | 43 +++++++++++++++++++ probability-theory/hw/hw1/hw1.typ | 60 +++++++++++++++++++++++++++ title.typ | 2 +- 3 files changed, 104 insertions(+), 1 deletion(-) create mode 100644 probability-theory/hw/hw-template.typ create mode 100644 probability-theory/hw/hw1/hw1.typ diff --git a/probability-theory/hw/hw-template.typ b/probability-theory/hw/hw-template.typ new file mode 100644 index 0000000..a1e2be6 --- /dev/null +++ b/probability-theory/hw/hw-template.typ @@ -0,0 +1,43 @@ +#let hw( + num: 0, + doc +) = [ + + #set document( + title: "Егор_Капралов_1.5_" + str(num), + author: "Капралов Егор" + ) + + #set page( + paper: "a4", + margin: (left: 30mm, right: 15mm, top: 20mm, bottom: 20mm), + numbering: "1" + ) + + #set text( + font: "Liberation Serif", + size: 12pt, + lang: "ru", + region: "RU" + ) + + #set par( + justify: true, + ) + + #show heading: it => { + set text(size: 14pt, weight: "bold") + block(above: 1.5em, below: 1.5em, it) + } + + #import "../../title.typ": itmo_title + + #itmo_title( + type: [Домашняя работа №#num], + name: none, + subject: [Теория вероятностей] + ) + + #doc +] + diff --git a/probability-theory/hw/hw1/hw1.typ b/probability-theory/hw/hw1/hw1.typ new file mode 100644 index 0000000..410a0ce --- /dev/null +++ b/probability-theory/hw/hw1/hw1.typ @@ -0,0 +1,60 @@ +#import "../hw-template.typ" +#import hw-template: * + +#show: doc => hw( + num: 1, + doc +) + +#let ol(text) = $overline(text)$ + +#outline() +#pagebreak() + += Задание 1.8 + +Упростить выражение $A = (B+C)(B+ol(C))(ol(B)+C)$ + +$ A = (B+C)(B+ol(C))(ol(B)+C) = B(ol(B)+C) = B C $ + +*Ответ*: $B C$ + += Задание 1.11 + +Доказать, что $ol(A)B+A ol(B)+ol(A B)=ol(A B)$ + +$ ol(A)B+A ol(B)+ol(A B) &= ol(A)B+A ol(B)+ol(A)+ol(B) = ol(A)(B+U)+ol(B)(A+U) \ += ol(A) + ol(B) = ol(A B) $ + += Задание 1.12 + +Доказать эквивалентность и справедливость следующих двух равенств: + +$ ol(sum^n_(k=1) A_k) = product^n_(k=1) ol(A_k) #h(5em) sum^n_(k=1) ol(A_k) = ol(product^n_(k=1) A_k) $ + + + += Задание 1.14 + +Доказать, что события $A, ol(A)B$ и $ol(A+B)$ образуют полную группу. + +$ A + ol(A)B + ol(A+B) = A + ol(A)B + ol(A) thin ol(B) = $ + += Задание 1.15 + + + += Задание 2.8 + + + += Задание 2.5 + + + += Задание 2.7 + + + += Задание 2.10 + diff --git a/title.typ b/title.typ index 15c248e..4b05f8e 100644 --- a/title.typ +++ b/title.typ @@ -32,7 +32,7 @@ #type - "#name" + #if name != none { ["#name"] } #[ #set text(size: 11pt)