Abstract
A recursive function is a function which calls itself in its definition (true, pretty confusing!). However, recursive functions arise very naturally. This chapter studies recursive functions and how these functions are handled with ease in Mathematica.
This is a preview of subscription content, log in via an institution to check access.
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 Springer-Verlag London Limited
About this chapter
Cite this chapter
Hazrat, R. (2010). Recursive functions. In: Mathematica®: A Problem-Centered Approach. Springer Undergraduate Mathematics Series, vol 53. Springer, London. https://doi.org/10.1007/978-1-84996-251-3_11
Download citation
DOI: https://doi.org/10.1007/978-1-84996-251-3_11
Publisher Name: Springer, London
Print ISBN: 978-1-84996-250-6
Online ISBN: 978-1-84996-251-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)