CIS 1910 Lecture Notes - Lecture 19: Middle Ages, Fibonacci, Discrete Mathematics

• School: University of Guelph
• Department: Computing and Information Science
• Course: CIS 1910
• Professor: Luiza Antonie

Document Summary

A sequence is a special type of function in which the domain is a consecutive set of integers. When a function is specified as a sequence, using subscripts to denote the input to the function is more common. The expression gk is called a term of a sequence and the variable k is the index of g k. A sequence with a finited domain is called a finite sequence. In a finite sequence there is an initial index m and a final index n where n is greater than or equal to m: am,am+1, an. A sequence with an infinite domain is called an infinite sequence. In an infinite sequence, the indices go to infinity in the positive direction. There is an initial index m, and the sequence is defined for all indices k such that k is greater than or equal to m.