Cub11k's BIU Notes
Cub11k's BIU Notes
Assignments
Discrete-math
Discrete-math 1
Discrete-math 10
Discrete-math 11
Discrete-math 12
Discrete-math 2
Discrete-math 3
Discrete-math 4
Discrete-math 5
Discrete-math 6
Discrete-math 7
Discrete-math 8
Discrete-math 9
Infi-1
Infi-1 10
Infi-1 11
Infi-1 2
Infi-1 3
Infi-1 4
Infi-1 5
Infi-1 6
Infi-1 7
Infi-1 8
Infi-1 9
Linear-1
Linear-1 1
Linear-1 10
Linear-1 11
Linear-1 12
Linear-1 2
Linear-1 3
Linear-1 4
Linear-1 5
Linear-1 6
Linear-1 7
Linear-1 8
Linear-1 9
Linear-2
Linear-2 1
Lectures
Data-structures
Data-structures 1
Data-structures 2
Data-structures 3
Discrete-math
Discrete-math 10
Discrete-math 11
Discrete-math 12
Discrete-math 13
Discrete-math 14
Discrete-math 15
Discrete-math 16
Discrete-math 18
Discrete-math 19
Discrete-math 20
Discrete-math 21
Discrete-math 22
Discrete-math 23
Discrete-math 24
Discrete-math 25
Discrete-math 26
Discrete-math 3
Discrete-math 4
Discrete-math 5
Discrete-math 6
Discrete-math 7
Discrete-math 8
Discrete-math 9
Exam 2023 (2A)
Exam 2023 (2B)
Exam 2023 (A)
Exam 2023 (B)
Exam 2023 (C)
Exam 2024 (A)
Exam 2024 (B)
Exam 2024 (C)
Midterm
Infi-1
Exam 2022B (A)
Exam 2022B (B)
Exam 2023B (A)
Exam 2023B (B)
Exam 2024 (A)
Exam 2024 (B)
Exam 2025 (A)
Infi-1 10
Infi-1 12
Infi-1 13
Infi-1 14
Infi-1 15
Infi-1 16
Infi-1 17
Infi-1 19
Infi-1 20
Infi-1 21
Infi-1 22
Infi-1 23
Infi-1 24
Infi-1 25
Infi-1 26
Infi-1 5
Infi-1 6
Infi-1 7
Infi-1 9
Midterm
Theorems and proofs
Infi-2
Infi-2 1
Infi-2 10
Infi-2 11
Infi-2 12
Infi-2 13
Infi-2 14
Infi-2 15
Infi-2 16
Infi-2 17
Infi-2 2-3
Infi-2 3-4
Infi-2 5
Infi-2 6
Infi-2 7
Infi-2 8
Infi-2 9
Linear-1
Exam 2023 (B)
Exam 2023 (C)
Exam 2024 (A)
Exam 2024 (B)
Exam 2024 (C)
Exam 2025 (A)
Linear-1 11
Linear-1 12
Linear-1 13
Linear-1 4
Linear-1 5
Linear-1 6
Linear-1 7
Linear-1 8
Linear-1 9
Midterm
Random exams
Theorems and proofs
Linear-2
Linear-2 1
Linear-2 2
Linear-2 3
Linear-2 4
Linear-2 5
Linear-2 6
Linear-2 7
Linear-2 8
Seminars
CSI
CSI 2
Data-structures
Data-structures 1
Data-structures 2
Data-structures 3
Discrete-math
Discrete-math 1
Discrete-math 10
Discrete-math 11
Discrete-math 12
Discrete-math 2
Discrete-math 3
Discrete-math 4
Discrete-math 5
Discrete-math 6
Discrete-math 7
Discrete-math 8
Discrete-math 9
Infi-1
Infi-1 10
Infi-1 11
Infi-1 12
Infi-1 13
Infi-1 3
Infi-1 4
Infi-1 5
Infi-1 6
Infi-1 8
Infi-2
Infi-2 1
Infi-2 2
Infi-2 3
Infi-2 4
Infi-2 6
Infi-2 7
Infi-2 8
Linear-1
Linear-1 10
Linear-1 11
Linear-1 12
Linear-1 3
Linear-1 5
Linear-1 6
Linear-1 7
Linear-1 8
Linear-1 9
Linear-2
Linear-2 1
Linear-2 2
Linear-2 3
Linear-2 4
Linear-2 5
Linear-2 6
Linear-2 7
Templates
Lecture Template
Seminar Template
Home
Infi-1 15
Infi-1 15
Bounded series
#definition
Series are called bounded if the sequence of it’s partial sums is bounded
∃
M
:
∀
N
∈
N
:
|
∑
n
=
1
N
|
≤
M
Dirichlet's test
#theorem
∑
b
n
is bounded
a
n
monotonically non-increasing
,
a
n
→
0
Then
∑
b
n
a
n
→
M
1
Example:
∑
(
−
1
)
n
n
=
∑
(
−
1
)
n
⋅
1
n
|
∑
(
−
1
)
n
|
≤
1
1
n
→
0
⟹
∑
(
−
1
)
n
n
→
M
1
Proof:
a
n
→
0
and
a
n
is monotonically non-increasing
⟹
∀
n
∈
N
:
a
n
≥
0
∑
b
n
is bounded
⟹
S
N
=
∑
n
=
1
N
b
n
is bounded
∑
a
n
b
n
→
L
⟺
∀
ε
>
0
:
∃
N
ε
:
∀
N
,
M
>
N
ε
∈
N
:
|
∑
n
=
M
+
1
N
a
n
b
n
|
<
ε
|
∑
n
=
M
+
1
N
a
n
b
n
|
=
|
∑
n
=
M
+
1
N
a
n
(
S
n
−
S
n
−
1
)
|
=
|
∑
n
=
M
+
1
N
a
n
S
n
−
∑
n
=
M
+
1
N
a
n
S
n
−
1
|
=
=
|
−
S
M
a
M
+
1
+
∑
n
=
M
+
1
N
−
1
S
n
(
a
n
−
a
n
+
1
)
+
S
N
a
N
|
≤
≤
|
−
S
M
a
M
+
1
|
+
∑
n
=
M
+
1
N
−
1
|
S
n
(
a
n
−
a
n
+
1
)
|
+
|
S
N
a
N
|
=
=
|
S
M
|
⋅
|
a
M
+
1
|
+
∑
n
=
M
+
1
N
−
1
|
S
n
|
⋅
|
(
a
n
−
a
n
+
1
)
|
+
|
S
N
|
⋅
|
a
N
|
|
S
n
|
≤
K
a
N
,
a
M
+
1
≥
0
a
M
+
1
≥
a
M
+
2
≥
…
⟹
a
M
+
1
−
a
M
+
2
≥
0
⟹
|
S
M
|
⋅
|
a
M
+
1
|
+
∑
n
=
M
+
1
N
−
1
|
S
n
|
⋅
|
(
a
n
−
a
n
+
1
)
|
+
|
S
N
|
⋅
|
a
N
|
≤
K
⋅
(
a
M
+
1
+
∑
n
=
M
+
1
N
(
a
n
−
a
n
+
1
)
+
a
N
)
⟹
|
∑
n
=
M
+
1
N
a
n
b
n
|
≤
K
⋅
(
a
M
+
1
+
a
M
+
1
−
a
M
+
2
+
⋯
+
a
N
−
1
−
a
N
+
a
N
)
=
=
K
⋅
2
a
M
+
1
|
∑
n
=
M
+
1
N
a
n
b
n
|
≤
2
K
⋅
a
M
+
1
∀
ε
>
0
:
∃
N
ε
:
∀
M
>
N
ε
:
|
a
M
+
1
|
<
ε
2
K
⟹
∀
ε
>
0
:
∃
N
ε
:
∀
M
>
N
ε
:
|
∑
n
=
M
+
1
N
a
n
b
n
|
≤
2
K
⋅
a
m
+
1
<
2
K
⋅
ε
2
K
=
ε
∑
(
−
1
)
n
,
∑
sin
(
n
)
,
∑
cos
(
n
)
are bounded series
∑
sin
(
n
)
is bounded
⟹
∑
sin
(
n
)
n
=
∑
(
sin
(
n
)
⋅
1
n
⏟
→
0
)
→
M
1