Series&SequencesI:A.P.,G.P.

, Summary
SEQUENCESANDSERIES AsequenceU1,U2,U3,,Un,isasetofnumbersarrangedinadefiniteorder. Aseriesisthesumofthetermsofasequence. Foranysequence, U n = Sn Sn 1 ,whereSn=U1+U2+U3++Un. RECURRENCESEQUENCE A recurrence relation is an equation that defines a sequence recursively: each term of the sequence is defined as a function of the preceding terms. A sequenceobtainedinthismanneriscalledarecurrencesequence. UsingGCtoGenerateaSequence ToworkwithsequencesintheSEQmode: (1)PressMkey (2)ChooseSEQinthefourthline (3)HitetohighlightSEQ (4)Leaveothersettingsasdefault (5)Press! Todefineasequence,youmustspecify: nMinthestartingnumberforthesubscript(mostlikelythisvalueis1) u(n)theruleforthesequence(usexand`7toobtain n andu u ukeys respectively) u(nMin)theinitialconditionvalue(s) Note:Remembertocheckthetablesettings(keyin`@)andsetTblStart tothecorrectvalue(usually1). CONVERGENCEOFASEQUENCE If a sequence u1, u2, u3, , un, is convergent, then the terms in this sequence getcloserandclosertoacertainnumber,Lasnincreases.Wewrite lim un = L ,
n

ARITHMETICPROGRESSION(A.P.) FirstTerm, a CommonDifference, d GeneralTermofanA.P. SumtonthTermofanA.P. U n = a + (n 1)d n S n = [2a + (n 1)d ] 2 ToshowthatasequenceisinA.P. n S n = [a + U n ] 2 U n U n 1 = constant = d GEOMETRICPROGRESSION(G.P.) FirstTerm, a CommonRatio, r General TermofaG.P. U n = ar n 1 ToproveanysequenceisaG.P. Un = constant = r

SumtonthTermofaG.P.
a( r n 1) Sn = OR r 1 a (1 r n ) Sn = 1 r where r 1

i.e., un L as n .Liscalledthelimitofthesequence. . IfLdoesnotexist,thenwesaythesequenceisdivergent. SIGMANOTATION(SUMMATIONNOTATION)

r =m

SumtoInfinityof GeometricSeries
a S = , r <1 1 r

Ur isthesumofallthetermsfromU

mtoUn.

U n 1

Series&SequencesI:A.P.,G.P., Summary
i.e.

U
r =m

=Um+Um+1+Um+2++Un1+Un
n

Note:Thereare ( n m + 1) termsintheseries U r .
r =m

Note that besides Useful Results (1) to (7), some series may be evaluated using MethodofDifference(pleaserefertoSummaryonSeries&SequencesII).

(1) (2) (3) (4) (5) (6) (7)

UsefulResultsforEvaluationofSeries If a isaconstant,
n

a = na
r =1

a = (n m + 1)a n a ( a 1) ar = a 1
r =m
n

(SumofntermsinaG.P,firstterm=a,r=a)

r =
r =1
n r =1

r =1 n

n ( n + 1) (SumofntermsinaA.P,firstterm=1,lastterm=n) 2
n

a f(r ) = a f(r )
r =1

whereaisaconstant
n

{f(r ) g(r )} = f(r ) g(r )

f(r ) = f(r ) f(r )
r =m r =1 r =1

r =1 n

r =1 m 1

r =1

(Changeofindex)

CommonMistakes:
n

f (r ) 1. r =1 g( r )
2.

f (r ) g(r )
r =1 r =1 n

( f (r )
r =1

g(r ) ) f (r ) g(r )
r =1 r =1