Scribd
Upload
50 views33 pages

Math Presentation

1. A sequence is an ordered list of numbers that follow a particular pattern or rule. There are two main types of sequences: arithmetic sequences where each term is the sum of the previous term and a constant, and geometric sequences where each term is the product of the previous term and a constant. 2. Summation notation provides a shorthand way to write the sum of a sequence using the Greek letter sigma. It represents the sum from an initial term to a final term. Infinite geometric series can also be written using summation notation. 3. Algorithms are precise step-by-step instructions to solve problems using computations. Common algorithms include linear search, binary search, bubble sort, and insertion sort. Big

Uploaded by

Tran Manh Tuan (K18 HCM)
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
50 views33 pages

Math Presentation

1. A sequence is an ordered list of numbers that follow a particular pattern or rule. There are two main types of sequences: arithmetic sequences where each term is the sum of the previous term and a constant, and geometric sequences where each term is the product of the previous term and a constant. 2. Summation notation provides a shorthand way to write the sum of a sequence using the Greek letter sigma. It represents the sum from an initial term to a final term. Infinite geometric series can also be written using summation notation. 3. Algorithms are precise step-by-step instructions to solve problems using computations. Common algorithms include linear search, binary search, bubble sort, and insertion sort. Big

Uploaded by

Tran Manh Tuan (K18 HCM)
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 33

Group 3

presentation
Class: MAD-SE1838
Table of contents

01 02
Sequence Summations

03 04
Algorithms The Growth of function
01
Sequence
Definition of sequence

A sequence (dãy) is an ordered list of numbers, called


terms, that follow a particular pattern or rule.

1,3,5,8: Finite sequence.


1, 4, 9, 16,…, rn : Infinite sequence.
Types of Sequence
Arithmetic sequences (cấp số cộng): where each term is the sum
of the previous term and a fixed constant.

f(n) = a + nd → a, a+d, a+ 2d, … , a+nd


a: initial term.
d: common difference, real number.
Types of Sequence
Geometric sequences (cấp số nhân): where each term is the
product of the previous term and a fixed constant.

f(n) = arn → a, ar, ar2, ar3, …, arn


a: initial term.
r: common ratio, a real number.
More Examples on Sequences
Arithmetic sequences:

an= -1 + 4n, n>=0


a = -1 (initial term)
d = 4 (common ratio)
More Examples on Sequences
Geometric sequences:

cn= 2(5)n , n>=0


a = 2 (initial term)
r = 5 (common ratio)
More Examples on Sequences
What is the term a8 of the sequence {an} if an equals?

a) 7 b) 1 + (−1)n c)−(−2)n

a) For the sequence an = 7, the term a8 is 7.


b) For the sequence an = 1 + (−1)n, the term a8 is 2.
c) For the sequence an = -(−2)n, the term a8 is -256.
02
Summations
Definition of Summation

Summation notation: Summation notation is a shorthand way


of writing the sum of a sequence. It uses the Greek letter
sigma (∑) to represent the sum.

a : Sequence
j : Index of summation
m: Lower limit
n : Upper limit
Summation of geometric series

a : initial term
n : Upper limit
r: common ratio
More Examples on Summation
Infinite geometric sequence: 2,6,18,54,...

Related infinite geometric series: 2+6+18+54+...

Written in sigma notation:


∞
∑ (2.3n) = 2 + 6 + 18 + 54 +...
n=0
Properties of Summation
Example of Summation
a) ∑5k=1(𝑘+1) b) ∑4j=1(j+2)4 c) ∑3i=1∑4j=2ij

a) ∑5k=1(𝑘+1) = (1+1) + (2+1) + (3+1) + (4+1) + (5+1)


=2+3+4+5+6
= 20
b) ∑4j=1(j+2)4 = (1+2)4 + (2+2)4 + (3+2)4 + (4+2)4
= 81 + 256 + 625 + 1296
= 2258
c) ∑3i=1 ∑4j=2ij = ∑3i=1 (2𝑖+3𝑖+4𝑖) = ∑3i=19𝑖= 9(1+2+3) = 54
03
Algorithms
Definition of Algorithms

An algorithm is a finite set of precise instructions for


performing a computation or for solving a problem.

Searching: Linear and Binary search.


Sorting: Bubble and Insertion sort.
Finding the maximum elenment in a finite sequence
Procedure max (a1, a2, a3,…, an: integers)
max:=a1
for i:=2 to n
if max < ai then max:= ai
{max is the largest element}
Linear Search Algorithm
Binary Search Algorithm
Bubble Sort Algorithms
Insertion Sort Algorithms
procedure insertionSort(arr):
for i = 1 to n-1
key = arr[i]
j = i-1
while j >= 0 and arr[j] > key
swap arr[j+1] with arr[j]
j=j-1
end while
end for
end function
04
Growth of functions
Definition of Big-O Notation
Big O notation is a mathematical notation that describes the
limiting behavior of a function when the argument tends towards
a particular value or infinity.
Example of Big-O Notation
Theorem 1 of Big-O Notation
The Growth of Combinations of Functions
Theorem 2 and 3 of Big-O Notation
Big-Omega and Big-Theta Notation

Big-O does not provide the lower bound for the size of f(x)
Big-Ω( Omega), Big- θ( Theta) were introduced by Donald Knuth in the
1970s
Big-Ω provides the lower bound for the size of f(x)
Big- θ provides the upper bound and lower bound on the size of f(x)
Big-Omega and Big-Theta Notation Theorem
Theorem 4

You might also like