Popular in Discrete structure
Popular in Computer Information Systems
This 1 page Class Notes was uploaded by ying.fan Notetaker on Saturday October 3, 2015. The Class Notes belongs to Cs2913 at Arkansas State University taught by E.T. Hammerand in Summer 2015. Since its upload, it has received 33 views. For similar materials see Discrete structure in Computer Information Systems at Arkansas State University.
Reviews for DS_WEEK__SIX
Report this Material
What is Karma?
Karma is the currency of StudySoup.
Date Created: 10/03/15
IiSEunSequeneszused to represent an ordered A se uence is a function from a subset of the set 0 integers A grometriczorogression is a sequence of the form aar ar ar n An arithmetic ro ression is a se uence of the form a ab aPIZg and q An arithm tic progr ssion is discr te analogue oft e linear unction x xa A rariirrnnrn rnlntinn fnr thn caminnrnfanlic a equation that expresses an in terms of one or more of the EFGVIOUS te ms fthe sequenc namelyaOa an1 or al integers n Wit n gtnO where n i a nonegative integerA sequence is ca e a SQIUtl n of a recurrence relation if Its terms satify t e recurrence relationA rchrrence relation is said to recurswely e ne a sequence The initial condtitions for a recursively de ned e uence 560 the terms that precede the eIiggectterm w ere the recurrence relation takes quotFibonacci sequenc f0 f1 f2 is de ned by initial con itions O O f1 1 an the recurrence re ation fn fnl fn2 for n 234 iteration we have iterated or repeatedly used the recurrence relation