Scribd
Upload
78 views33 pages

Sequences & Summation Notation

This document provides an introduction to sequences and summation notation. It defines sequences as sets of numbers arranged in a particular order. Infinite sequences are functions with positive integers as the domain. Finite sequences have a bounded domain. Examples of finite and infinite sequences are given. The document discusses writing terms of sequences, finding patterns in sequences, recursive definitions of sequences using initial conditions and formulas, and factorial notation for products. It introduces summation notation using sigma, defines series as sums of sequences, and gives properties of sums. Examples are provided for writing terms, finding patterns, sums of sequences, and using sigma notation to represent both finite and infinite series.

Uploaded by

romellramos
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
78 views33 pages

Sequences & Summation Notation

This document provides an introduction to sequences and summation notation. It defines sequences as sets of numbers arranged in a particular order. Infinite sequences are functions with positive integers as the domain. Finite sequences have a bounded domain. Examples of finite and infinite sequences are given. The document discusses writing terms of sequences, finding patterns in sequences, recursive definitions of sequences using initial conditions and formulas, and factorial notation for products. It introduces summation notation using sigma, defines series as sums of sequences, and gives properties of sums. Examples are provided for writing terms, finding patterns, sums of sequences, and using sigma notation to represent both finite and infinite series.

Uploaded by

romellramos
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 33

Sequences & Summation Notation

8.1

JMerrill, 2007 Revised 2008

Sequences In Elementar Sc!ool"

12 12

#2

$nd"

17

12

Even
12

22

Sequences
SEQUENCE % a set o& num'ers, called terms, arran(ed in a )articular order.

Sequences
$n infinite sequence is a &unction *!ose domain is t!e set o& )ositive inte(ers. +!e &unction values a1, a2, a#, ", an" are t!e terms o& t!e sequence. I& t!e domain o& t!e sequence consists o& t!e &irst n )ositive inte(ers onl , t!e sequence is a finite sequence.
n is t!e term num'er.

E,am)les
-inite sequence. 2, /, 10, 10

1 1 1 1 In&inite sequence. , , , ,... 2 4 8 16

1ritin( t!e +erms o& a Sequence


1rite t!e &irst 0 terms o& t!e sequence an 2 #n 3 2 a1 2 #415 3 2 2 1 a2 2 #425 3 2 2 0 a# 2 #4#5 3 2 2 7 a0 2 #405 3 2 2 10
6alculator ste)s in 7IS+

1ritin( t!e +erms o& a Sequence


1rite t!e &irst 0 terms o& t!e sequence an 2 # 8 4%15n a1 2 # 8 4%151 2 2 a2 2 # 8 4%152 2 0 a# 2 # 8 4%15# 2 2 a0 2 # 8 4%150 2 0

9ou :o
1rite t!e &irst 0 terms o& t!e sequence

( 1) an = 2n 1
n

1 1 1 1 1, , , , 3 5 7 9

;ra)!s
6onsider t!e in&inite sequence
1 1 1 1 1 , , , , ..., ... 2 4 8 16 2
<ecause a sequence is a &unction *!ose domain is t!e set o& )ositive inte(ers, t!e (ra)! o& a sequence is a set o& distinct )oints. +!e &irst term is = , t!e 2nd term is > " So, t!e ordered )airs are 41, = 5, 42, > 5"
n

-indin( t!e nt! +erm o& a Sequence


1rite an e,)ression &or t!e nt! term 4an5 o& t!e sequence 1, #, ?, 7"
$l*a s com)are t!e term to t!e term num'er

n. 1, 2, #, 0"n +erms. 1, #, ?, 7"an $))arent )attern. eac! term is 1 less t!an t*ice n. So, t!e a))arent nt! term is an 2 2n % 1

-indin( t!e nt! +erm o& a Sequence 9ou :o


1rite an e,)ression &or t!e nt! term 4an5 o& t!e sequence
1 1 1 1 1, , , , ... 4 9 16 25
n 2 1, 2, #, 0"n

1 1 1 1 Terms = 1, , , , ...an 4 9 16 25

$))arent )attern.
+!e numerator is 1@ t!e denominator is t!e square o& n.

1 an = 2 n

Recursive :e&inition
Sometimes a sequence is de&ined ' (ivin( t!e value o& an in terms o& t!e )recedin( term, an-1. $ recursive sequence consists o& 2 )arts. $n initial condition t!at tells *!ere t!e sequence starts. $ recursive equation 4or &ormula5 t!at tells !o* man terms in t!e sequence are related to t!e )recedin( term.

E,am)le
I& an 2 an-1 8 0 and a1 2 #, (ive t!e &irst &ive terms o& t!e sequence. a1 2 # I& n 2 2. a2 2 a1 8 0 2 # 8 0 2 7 I& n 2 #. a3 2 a2 8 0 2 7 8 0 2 11 I& n 2 0. a4 2 a3 8 0 2 11 8 0 2 1? I& n 2 ?. a5 2 a4 + 0 2 1? 8 0 2 1A

$ -amous Recursive Sequence


+!e -i'onacci Sequence is ver *ell Bno*n 'ecause it a))ears in nature. +!e sequence is 1, 1, 2, #, ?, 8, 1#" $))arent )atternC Eac! term is t!e sum o& t!e )recedin( 2 terms +!e nt! term is an 2 an%2 8 an%1

E,am)le
1rite t!e &irst 0 terms o& t!e sequence

a0 2 1 a1 2 2 a2 2 2 a# 2 0D# a0 2 2D#

2 an = , begin with n = 0 n!
n

-actorial Notation
Eroducts o& consecutive )ositive inte(ers occur quite o&ten in sequences. +!ese )roducts can 'e e,)ressed in &actorial notation. +!e &actorial Be can 'e 1F 2 1 &ound in M$+H ER<.0 on our calculator 2F 2 2 G 1 2 2 #F 2 # G2 G1 2 / 0F, ' de&inition, 2 1 0F 2 0 G# G2 G1 2 20 ?F 2 ? G0 G# G2 G1 2 120

E,am)le
1rite t!e &irst &our terms o& t!e sequence

2 an = (n 1)!
n

21 2 2 a1 = = = =2 (1 1)! 0! 1 22 4 4 a2 = = = =4 (2 1)! 1! 1 23 8 8 a3 = = = =4 (3 1)! 2! 2 24 16 16 8 a4 = = = = (4 1)! 3! 6 3

Evaluatin( -actorials in -ractions


Evaluate.
10! 2!8!
10 9 8! 90 = = 45 2 1 8! 2

( n + 1) !
n!
(n + 1) n ! =n +1 n!

:e&initions
+!e *ords sequences and series are o&ten used interc!an(ea'l in ever da conversation. 4$ )erson ma re&er to a sequence o& events or a series o& events.5 In mat!ematics, t!e are ver di&&erent. Sequence. a set o& num'ers, terms, arran(ed in a )articular order Series. t!e sum o& a sequence

E,am)les
-inite sequence. 2, /, 10, 10 -inite series. 2 8 / 8 10 8 10 In&inite sequence. In&inite series.

1 1 1 1 , , , ,... 2 4 8 16

1 1 1 1 + + + + ... 2 4 8 16

Intro to Si(ma
+!e ;reeB letter 4si(ma5 is o&ten used in mat!ematics to re)resent a sum 4series5 in a''reviated &orm. E,am)le. k 2 = 12 + 22 + 32 + ... + 1002 *!ic!
k =1 100

can 'e read as It!e sum o& B 2 &or values o& B &rom 1 to 100.J

:e&inition o& a Series


6onsider t!e in&inite series a1, a2, " an" +!e sum o& t!e &irst n terms is a &inite series 4or )artial sum5 and is denoted '
n

a
i =1

+!e sum o& all terms o& an in&inite sequence is called an in&inite series and is denoted ' a

i =1

Si(ma 6ontinued
Similarl , t!e s m'ol k =5 is read It!e sum o& #B &or values o& B &rom ? to 10.J +!is means t!at t!e s m'ol re)resents t!e series *!ose terms are o'tained ' evaluatin( #B &or B 2 ?, B 2 /, and so on, to B 2 10.

3k

10

3k = 3(5) + 3(6) + 3(7) + 3(8) + 3(9) + 3(10) = 135


k =5

10

:e&initions
7imits o& Summation
10

3i = 3(5) + 3(6) + 3(7) + 3(8) + 3(9) + 3(10) = 135


i =5

Summand

Inde, o& Summation

E,am)le
1 1 1 1 1 1 = + + + + 2 2 2 2 2 k =1 2 1 1 1 1 1 11 = + + = 2 4 8 16 32 32
5 k 1 2 3 4 5

Si(ma Notation Re)resentin( In&inite Series


1 1 1 1 1 = + + + + ... 2 2 2 2 j =0 2 1 1 1 = 1 + + + + ... = 2 2 4 8
j 0 1 2 4

;ive t!e series in e,)anded &orm. 5k


4

k =1

?81081?820

-ind t!e Sum o&


1A0

2 i

i =4

6alculator ste)s. in 7IS+

Kne More. -ind t!e Sum o& k 3


=2

108A

Ero)erties o& Sums


1. c = cn, c is a constant
i =1 n

2. cai = c ai , c is a constant
i =1 i =1

3. (ai + bi ) = ai + bi
i =1 i =1 i =1

4. (ai bi ) = ai bi
i =1 i =1 i =1

7ast Ero'lem
-ind t!e sum o&

(1) k! k =0
4

3 8

You might also like