Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
0 of .
Results for:
P. 1
Ch06

# Ch06

Ratings: (0)|Views: 2 |Likes:

### Availability:

See more
See less

12/03/2013

pdf

text

original

Fall 2002CMSC 203 -Discrete Structures1
Now it·s Time for«Now it·s Time for«
RecurrenceRecurrenceRelationsRelations

Fall 2002CMSC 203 -Discrete Structures2
R
ecurrence
R
elations
R
ecurrence
R
elations
AA
recurrence relationrecurrence relation
for the sequence {afor the sequence {a
nn
} is an} is anequation that expresses aequation that expresses a
nn
is terms of one oris terms of one ormore of the previous terms of the sequence,more of the previous terms of the sequence,namely, anamely, a
00
, a, a
11
, «, a, «, a
nn--11
, for all integers n with, for all integers n withnn
uu
nn
00
, where n, where n
00
is a nonnegative integer.is a nonnegative integer.A sequence is called aA sequence is called a
solutionsolution
of a recurrenceof a recurrencerelation if it terms satisfy the recurrencerelation if it terms satisfy the recurrencerelation.relation.

Fall 2002CMSC 203 -Discrete Structures3
R
ecurrence
R
elations
R
ecurrence
R
elations
In other words, a recurrence relation is like aIn other words, a recurrence relation is like arecursively defined sequence, butrecursively defined sequence, but
w
ithout
w
ithoutspecifying any initial values (initial conditions)specifying any initial values (initial conditions)
..Therefore, the same recurrence relation can haveTherefore, the same recurrence relation can have(and usually has)(and usually has)
multiple solutionsmultiple solutions
..IfIf
bothboth
the initial conditions and the recurrencethe initial conditions and the recurrencerelation are specified, then the sequence isrelation are specified, then the sequence is
uniquelyuniquely
determined.determined.