# Recursive Function

## Topic

Functions and Relations

## Definition

A recursive function is a function that calls itself in its definition.

## Description

Recursive functions are important in mathematics and computer science because they provide a way to solve problems by breaking them down into simpler sub-problems. They are defined by a base case and a recursive case. For example, the factorial function

f(n) = n⋅f(n−1) with f(0)=1

is a recursive function. Recursive functions are used in various fields, including computer science for algorithms and in mathematics for sequences and series. Understanding recursive functions is essential for solving complex problems and for applying mathematical and computational models to real-world scenarios.

For a complete collection of terms related to functions and relations click on this link: Functions and Relations Collection

Common Core Standards CCSS.MATH.CONTENT.8.F.A.1, CCSS.MATH.CONTENT.8.F.B.5, CCSS.MATH.CONTENT.HSF.IF.A.1, CCSS.MATH.CONTENT.HSF.IF.A.2, CCSS.MATH.CONTENT.HSF.IF.C.7, CCSS.MATH.CONTENT.HSF.BF.A.1, CCSS.MATH.CONTENT.HSF.BF.B.3, CCSS.MATH.CONTENT.HSF.BF.B.4, CCSS.MATH.CONTENT.HSF.BF.A.1.A 6 - 9 Algebra     • Functions and Relations         • Relations and Functions 2021 definition, function, relations, glossary terms