Skip to main content
SpringerLink
Log in
Book cover

Fundamentals of Discrete Math for Computer Science pp 265–309Cite as

Sequences and Series

  • Chapter
  • First Online:

  • 15k Accesses

Part of the book series: Undergraduate Topics in Computer Science ((UTICS))

Abstract

Examples of sequences defined by recurrence equations are given and solved. Then, we provide the general method for solving all first-order recurrence equations. The Fibonacci sequence is explored in some depth, followed by the general method for solving second-order recurrence equations. This chapter ends with Zeno’s paradoxes and the formal definition of convergence of infinite series.

This is a preview of subscription content, log in via an institution.

Author information

Authors and Affiliations

  1. Department of Mathematics, Brock University, St. Catharines, ON, Canada

    Tom Jenkyns

  2. Department of Computer Science, University of Calgary, Calgary, AB, Canada

    Ben Stephenson

Authors
  1. Tom Jenkyns
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ben Stephenson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag London

About this chapter

Cite this chapter

Jenkyns, T., Stephenson, B. (2013). Sequences and Series. In: Fundamentals of Discrete Math for Computer Science. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-4069-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-4069-6_7

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-4068-9

  • Online ISBN: 978-1-4471-4069-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation