Recursive Formula (2024)

Did you know that a sequence can be defined recursively and explicitly?

Recursive Formula (1)

Jenn, Founder Calcworkshop®, 15+ Years Experience (Licensed & Certified Teacher)

What Is A Sequence

Formally, a sequence is an enumerated collection of objects, but informally, a sequence is a countable structure representing an ordered list of elements or numbers.

Recursive Formula (2)

Definition Sequence

And we specify a sequence either recursively or explicitly.

Recursive Formula Definition

So, what is recursion?

A recursive definition, sometimes called an inductive definition, consists of two parts:

  1. Recurrence Relation
  2. Initial Condition

A recurrence relation is an equation that uses a rule to generate the next term in the sequence from the previous term or terms. In other words, a recurrence relation is an equation that is defined in terms of itself.

And all recurrence relations must come with an initial condition, which is a list of one or more terms of the sequence that precede the first term where the recurrence relation starts.

Example

For instance,

Recursive Formula (3)

List Terms Recursive — Example

Notice that this looks just like the procedure we use for mathematical induction!

The idea behind inductive proofs is similar to a staircase, as the only way to reach the top is to climb all the steps before it, as noted by Math Bits. The same thing is happening with recursion – each step is generated from the step or steps preceding.

Recursive Formula (4)

Staircase Analogy

Recursive Formulas For Sequences

Alright, so as we’ve just noted, a recursive sequence is a sequence in which terms are defined using one or more previous terms along with an initial condition. And the most classic recursive formula is the Fibonacci sequence.

The Fibonacci sequence is as follows: 0, 1, 1, 2, 3, 5, 8, 13, 21,…

Notice that each number in the sequence is the sum of the two numbers that precede it. For example, 13 is the sum of 5 and 8 which are the two preceding terms.

In fact, the flowering of a sunflower, the shape of galaxies and hurricanes, the arrangements of leaves on plant stems, and even molecular DNA all follow the Fibonacci sequence which when each number in the sequence is drawn as a rectangular width creates a spiral.

Isn’t it amazing to think that math can be observed all around us?

But, sometimes using a recursive formula can be a bit tedious, as we continually must rely on the preceding terms in order to generate the next.

So now, let’s turn our attention to defining sequence explicitly or generally. All this means is that each term in the sequence can be calculated directly, without knowing the previous term’s value.

Example

In this problem,

What we will notice is that patterns start to pop-up as we write out terms of our sequences. And it’s in these patterns that we can discover the properties of recursively defined and explicitly defined sequences.

We want to remind ourselves of some important sequences and summations from Precalculus, such as Arithmetic and Geometric sequences and series, that will help us discover these patterns.

Recursive Formula (5)

Arithmetic Sequence Formula


Recursive Formula (6)

Geometric Sequence Formula


Recursive Formula (7)

Summation Sequence Formulas

Armed with these summation formulas and techniques, we will begin to generate recursive formulas and closed formulas for other sequences with similar patterns and structures.

Example

So, using our known sequences, let’s find a recursive definition for the sequence 4,9,14,19,24,29,…

Recursive Formula (8)

Arithmetic Recursive — Example

Now, using our known summation formulae, let’s find a closed definition for the same sequence of 4,9,14,19,24,29,…

Recursive Formula (9)

Closed Form Arithmetic Sequence

Additionally, we will discover a superb procedure for finding the sum of an Arithmetic and Geometric sequence, using Gauss’s discovery of reverse-add and multiply-shift-subtract, respectively.

Example

Suppose we wanted to find the sum of the following sequence: 1,3,5,7,9,..,39.

First, we need to find the closed formula for this arithmetic sequence. To do this, we need to identify the common difference which is the amount that is being added to each term that will generate the next term in the sequence. The easiest way to find it is to subtract two adjacent terms. So, for our current example, if we subtract any two adjacent terms we will notice that the common difference is 2.

Recursive Formula (10)

Find Closed Form Of Arithmetic Sequence

Now, we can use the explicit formula to determine the number of terms that we are summing.

Recursive Formula (11)

Determine The Number Of Terms In Arithmetic Series

Finally, we apply the reverse and add method to find the sum, where we first list all the terms in one direction, then reverse and list all the terms in the opposite direction. In other words, we will “wrap” the series back onto itself, as MathBitsNotebook nicely states.

Recursive Formula (12)

Gauss Method Sum

Summary

Throughout this video, we will see how a recursive formula calculates each term based on the previous term’s value, so it takes a bit more effort to generate the sequence. In contrast, an explicit formula directly calculates each term in the sequence and quickly finds a specific term.

Both formulas, along with summation techniques, are invaluable to the study of counting and recurrence relations. And with these new methods, we will not only be able to develop recursive formulas for specific sequences, but we will be on our way to solving recurrence relations!

So, let’s jump right in and discover the fun!

Video Tutorial w/ Full Lesson & Detailed Examples

1 hr 49 min

  • Introduction to Video: Recursive Formula — Sequences — Summations
  • 00:00:51 Can you guess the pattern and determine the next term in the sequence? (Examples #1-7)
  • Exclusive Content for Members Only
  • 00:11:37 What is a Recursive Definition and Explicit Formula?
  • 00:21:43 Find the first five terms of the sequence (Examples #8-10)
  • 00:30:38 Recursive formula and closed formula for Arithmetic and Geometric Sequences
  • 00:40:27 Triangular — Square — Cube — Exponential — Factorial — Fibonacci Sequences
  • 00:47:42 Discover a recursive definition for each sequence (Examples #11-14)
  • 01:00:11 Use known sequences to find a closed formula (Examples #15-20)
  • 01:22:29 Using reverse—add method on Arithmetic Sequences (Examples #21-22)
  • 01:35:48 Summing Geometric Sequences using multiply—shift—subtract method (Examples #23-34)
  • 01:44:00 Summation and Product Notation (Example #25a-d)
  • Practice Problems with Step-by-Step Solutions
  • Chapter Tests with Video Solutions

Get access to all the courses and over 450 HD videos with your subscription

Monthly and Yearly Plans Available

Get My Subscription Now

Still wondering if CalcWorkshop is right for you?
Take a Tour and find out how a membership can take the struggle out of learning math.

Recursive Formula (13)
Recursive Formula (2024)

FAQs

What is the recursive formula? ›

FAQs on Recursive Formula

A recursive formula is a formula that defines any term of a sequence in terms of its preceding term(s). For example: The recursive formula of an arithmetic sequence is, an = an-1 + d. The recursive formula of a geometric sequence is, an = an-1r.

What is the recursive formula for 3, 6, 12, 24? ›

Final answer:

To find a recursive rule for the sequence 3, 6, 12, 24, ..., we identify that the sequence is geometric and the common ratio is 2. Thus, the recursive rule is an = 2an-1 with the first term a1 = 3.

How to calculate a recursive function? ›

Recursive Formula
  1. nth term of Arithmetic Progression an = an 1 + d for n ≥ 2.
  2. nth term of Geometric Progression an = an 1 × r for n ≥ 2.
  3. nth term in Fibonacci Sequence an = an 1 + an 2 for n ≥ 2 and a0 = 0 & a1 = 1.
May 30, 2024

What is the recursive formula for this sequence 12 16 20 24 28? ›

Final answer:

The given sequence is an arithmetic sequence with a common difference of 4. The recursive formula for this sequence is: an = a(n-1) + 4.

What is an example of a recursion? ›

Recursion can be equally well applied to computer algorithms: Some Computer related examples include: Adding a list of numbers, Computing the Fibonacci sequence, computing a Factorial, and Sudoku.

What is the recursive formula for 2 4 7 11 16? ›

We can generalize this pattern to find . We get that the recursive formula for the nth term of the sequence 2, 4, 7, 11, . . . is a n = a n − 1 + n , where a 1 = 2 .

What is the recursive rule for 2 3 5 8 13? ›

And the most classic recursive formula is the Fibonacci sequence. The Fibonacci sequence is as follows: 0, 1, 1, 2, 3, 5, 8, 13, 21,… Notice that each number in the sequence is the sum of the two numbers that precede it. For example, 13 is the sum of 5 and 8 which are the two preceding terms.

What is the recursive formula for 1 4 7 10 13? ›

This is an arithmetic sequence since there is a common difference between each term. In this case, adding 3 to the previous term in the sequence gives the next term. In other words, an=a1+d(n−1) a n = a 1 + d ( n - 1 ) .

How do you solve a recursive method? ›

  1. 3 Steps to Solve Any Recursion Problem. Solve Recursion problems easily with these 3 Steps. ...
  2. Step 1: Find the Base Case. There are two base cases for this problem: ...
  3. Step 2: Find the Recursive Relation. Recursive relation divides the problem into subproblems. ...
  4. Step 3: Combine the results from the Recursive function calls.
Sep 21, 2020

What is the formula of recursive relation? ›

Perhaps the most famous recurrence relation is Fn=Fn−1+Fn−2, F n = F n − 1 + F n − 2 , which together with the initial conditions F0=0 F 0 = 0 and F1=1 F 1 = 1 defines the Fibonacci sequence. But notice that this is precisely the type of recurrence relation on which we can use the characteristic root technique.

How to write a recursive formula for a geometric sequence? ›

A recursive formula for a geometric sequence with common ratio r is given by an=ran–1 for n≥2. As with any recursive formula, the initial term of the sequence must be given. See Example 11.3. 3.

How to write a recursive formula? ›

How do you write an arithmetic recursive formula? First, identify the common difference (how much each term in a sequence is increasing or decreasing from the previous term). State the first term of the sequence, and then write the recursive rule as (new term) = (previous term) + (common difference).

What is the recursive formula for 2 6 12 20 30? ›

Answer: The formula for the general term of the sequence: 2, 6, 12, 20, 30... is an = n2 + n.

What is the recursive formula for the sequence 5 10 15 20 25? ›

Answer and Explanation:

a n = 5 + ( n − 1 ) 5.

What is the recursive formula for 2 4 7 11? ›

Answer and Explanation:

We can generalize this pattern to find . We get that the recursive formula for the nth term of the sequence 2, 4, 7, 11, . . . is a n = a n − 1 + n , where a 1 = 2 .

What is a recursive definition for the sequence 8 6 4 2? ›

Expert-Verified Answer

A recursive definition for the sequence 8, 6, 4, 2, ... can be written as: a1 = 8; an = an-1 - 2; This definition states that the first term of the sequence is 8, and each subsequent term is obtained by subtracting 2 from the previous term.

What is the recursive formula for FN? ›

Fn=Fn−1+Fn−2 means that each term (Fn) is equal to the sum of the previous term (Fn−1) and the term before the previous term (Fn−2). We include initial conditions so the sequence has a place to start. Initial conditions are the first few terms in the sequence.

How do you find the recursive of a sequence? ›

A recursive sequence is a sequence in which terms are defined using one or more previous terms which are given. If you know the term of an arithmetic sequence and you know the common difference , , you can find the ( n + 1 ) th term using the recursive formula a n + 1 = a n + d .

Top Articles
Latest Posts
Article information

Author: Ms. Lucile Johns

Last Updated:

Views: 5519

Rating: 4 / 5 (41 voted)

Reviews: 80% of readers found this page helpful

Author information

Name: Ms. Lucile Johns

Birthday: 1999-11-16

Address: Suite 237 56046 Walsh Coves, West Enid, VT 46557

Phone: +59115435987187

Job: Education Supervisor

Hobby: Genealogy, Stone skipping, Skydiving, Nordic skating, Couponing, Coloring, Gardening

Introduction: My name is Ms. Lucile Johns, I am a successful, friendly, friendly, homely, adventurous, handsome, delightful person who loves writing and wants to share my knowledge and understanding with you.