Abstract
A sequence is simply a set whose elements are labelled by the positive integers (though a more formal definition is given in the next section). We write a sequence in the form s = (s1,s2, s3,…) where the dots indicate that the list of terms continues indefinitely, so that any term, for instance s491, is available for consideration if required. More explicitly we write s = (s1, s2, s3,…, sn,…) to indicate the nth term, or simply s = (2n) ∞1 . But sn alone (no parentheses!) is not the name of a sequence, it is the name of a number which is the nth term of a sequence. For instance s = (2n - 1) ∞1 is the sequence of odd integers, s = (1,3,5,…) whose nth term is sn = 2n - 1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag London
About this chapter
Cite this chapter
Walker, P.L. (2004). Sequences. In: Examples and Theorems in Analysis. Springer, London. https://doi.org/10.1007/978-0-85729-380-0_1
Download citation
DOI: https://doi.org/10.1007/978-0-85729-380-0_1
Publisher Name: Springer, London
Print ISBN: 978-1-85233-493-2
Online ISBN: 978-0-85729-380-0
eBook Packages: Springer Book Archive