Abstract
Before You Get Started. You have most likely seen sums of the form \(\sum\nolimits_{j = 1}^k {j = 1 + 2 + 3 + \cdots + k,}\) or products like \(k! = 1 \cdot 2 \cdot 3 \cdots k.\) In this chapter we will use the idea behind induction to define expressions like these. For example, we can define the sum 1+2+3+ ∙ ∙ ∙ +(k+1) by saying, if you know what 1+2+3+ ∙ ∙ ∙ +k means, add k+1 and the result will be 1+2+3+ ∙ ∙ ∙ +(k+1). Think about how this could be done; for example, how should one define 973685! rigorously, i.e., without using ∙ ∙ ∙ ? Find a formula for 1+2+3+ ∙ ∙ ∙ +k.
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
Corresponding author
Rights and permissions
Copyright information
© 2010 Matthias Beck and Ross Geoghegan
About this chapter
Cite this chapter
Beck, M., Geoghegan, R. (2010). Recursion. In: The Art of Proof. Undergraduate Texts in Mathematics, vol 0. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7023-7_4
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7023-7_4
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-7022-0
Online ISBN: 978-1-4419-7023-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)