CMPUT272 Lecture Notes - Lecture 11: Arithmetic Progression, Mathematical Induction, Stirling Number

190 views6 pages

Document Summary

De nitions for sequences: to write the rst few terms with the expectation that the general pattern will be obvious. 3, 5, 7, : to give an explicit formula for its n-th term an = ( 1)n n + 1. , for all integers n 0: to de ne it recursively, A recurrence relation to relate later terms to earlier terms. Initial conditions, values of the rst few terms (cid:26) 1, ak = 3, ak 1 + ak 2, k = 0 k = 1 k 2: example: fibonacci numbers: F0 = f1 = 1, fk = fk 1 + fk 2 for k 2: example: number of partitions of a set of n elements into r subsets (stirling number of the second kind): sn,r. # = the number of ways {a1, a2, . , an 1} can be partitioned into r 1 subsets sn 1,r 1.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Related Questions