Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Sequences - Discrete Mathematics - Lecture Slides, Slides of Discrete Mathematics

During the study of discrete mathematics, I found this course very informative and applicable.The main points in these lecture slides are:Sequences and Summations, Sequence Examples, Geometric Vs Arithmetic Sequences, Constant Factor, Fibonacci Sequence, Fibonacci References, Golden Ratio, Determining Sequence Formula, Geometric Progression

Typology: Slides

2012/2013

Uploaded on 04/27/2013

atasi
atasi 🇮🇳

4.6

(32)

136 documents

1 / 10

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1
Sequences and
Mathematical Induction
An important task of mathematics is to discover and
characterize regular patterns, such as those
associated with repeated processes.
The main mathematical structure to study repeated
processes is the sequence.
The main mathematical tool to verify conjectures
about patterns in sequences is mathematical
induction.
Docsity.com
pf3
pf4
pf5
pf8
pf9
pfa

Partial preview of the text

Download Sequences - Discrete Mathematics - Lecture Slides and more Slides Discrete Mathematics in PDF only on Docsity!

1

Sequences and

Mathematical Induction

An important task of mathematics is to discover and

characterize regular patterns, such as those

associated with repeated processes.

  • The main mathematical structure to study repeated

processes is the sequence.

  • The main mathematical tool to verify conjectures

about patterns in sequences is mathematical

induction.

2

Sequences

  • Sequence is a set of elements written in a row: am, am+1 , …, an.
  • The elements are called terms.
  • k is called subscript or index of ak.
  • am is the initial term; an is the final term.
  • am, am+1 , am+2 , … is an infinite sequence.

4

Explicit Formula for a sequence

  • Explicit (general) formula is a rule that

shows how the values of a (^) k depend on k.

  • Examples:
  1. ak=1+7k for 1, 8, 15, 22, 29.
  2. bk=2k^ for 2, 4, 8, 16, …
  3. c (^) k= (-1) k^ · (2k+1) for -3, 5, -7, 9, …

5

Summation Notation

Let m and n be integers such that m ≤ n.

Then

We call k index of the summation; m the lower limit of the summation; n the upper limit of the summation.

Ex.: Suppose a 3 =2, a 4 =-4, a 5 =0, a 6 =7. Then

m m n

n

k m

a (^) k = a + a + + + a

3 4 5 6 2 (^4 )^075

6

3

∑ = + + + = + − + +^ =

=

a a a a a k

k

7

Product Notation

Let m and n be integers such that m ≤ n.

Then

Examples : ♦

♦ For each n∈ Z +^ , is called n factorial. E.g., 4! = 1 · 2 · 3 · 4 = 24 Note: 0! = 1

m m n

n

k m

a (^) k = aa + ⋅ ⋅ a

4

1 4

3 3

2 2

1 1

3

1

= ⋅ ⋅ =

k = k

k

1 2! 1

k n n

n

k

∏ = ⋅ ⋅ ⋅^ =

=

8

Binary representation of integers

Recall that

if a = pk · 2k^ + pk-1 · 2k-1^ + … + p 1 · 2^1 + p 0 · 2^0 then a 10 = (pk pk-1 … p 1 p 0 ) 2 , where p 0 , p 1 , …, pk-1 , pk is a sequence of binary digits 0 and 1.

Question: How to find p 0 , p 1 , …, pk-1 , pk?

10

Converting from base 10 to base 2

 14 = 1 ·2^3 + 1 · 2 2 + 1 · 2^1 + 0 · 2^0

Thus, 14 10 = 1110 2

Generally , to get binary representation

for nonnegative integer a,

  • Repeatedly divide by 2 until a quotient of zero is obtained.
  • If the remainders found are r[0],r[1],…,r[k], then a 10 = ( r[k] r[k-1] … r[1] r[0] ) 2.