For questions about defining recursive functions, recursive algorithms and solving recursive equations.
For questions about defining recursive functions (tail or central embedding), recursive algorithms and solving recursive equations. This can involve custom made recursive formulae (e.g. f[x_]:=f[x-1]) or built-in functions to solve e.g. recurrence equations (RSolve to solve equations of the form a[n + 1] - 2 a[n] == 1), recursive replacement (ReplaceRepeated), or recursive application (Nest, FixedPoint, etc.).
Useful links:
- Controlling Infinite Evaluation tutorial (
$RecursionLimit, [$IterationLimit][7]) - Applying Functions Repeatedly tutorial
- Functions That Remember Values They Have Found (consider using the tag memoization)
- Demonstrations with "recursive function"
Example questions:
