answersLogoWhite

0

It is a formula, used in sequences, in which the value of the nth term is described in relation to one or more of the earlier terms.

A classic example is the Fibonacci sequence:

u(1) = 1

u(2) = 1

u(n) = u(n-1) + u(n-2) for n = 3, 4, 5, ...

User Avatar

Wiki User

12y ago

Still curious? Ask our experts.

Chat with our AI personalities

BeauBeau
You're doing better than you think!
Chat with Beau
ViviVivi
Your ride-or-die bestie who's seen you through every high and low.
Chat with Vivi
JudyJudy
Simplicity is my specialty.
Chat with Judy

Add your answer:

Earn +20 pts
Q: What is a Recursive Formula in mathematics?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Math & Arithmetic

What is the difference between a geometric sequence and a recursive formula?

what is the recursive formula for this geometric sequence?


Will the explicit formula find the same answer when using the recursive formula?

It is often possible to find an explicit formula that gives the same answer as a given recursive formula - and vice versa. I don't think you can always find an explicit formula that gives the same answer.


What is the recursive formula for 1 4 13 40 121?

The sequence 1, 4, 13, 40, 121 can be described by a recursive formula. The recursive relationship can be expressed as ( a_n = 3a_{n-1} + 1 ) for ( n \geq 2 ), with the initial condition ( a_1 = 1 ). This means each term is generated by multiplying the previous term by 3 and then adding 1.


What is an expression that contains numbers operations and one or more variables?

That sounds like the definition for Recursive Formula.


What is a recursive formula and what is it used for Geometric and Arithmetic?

A recursive definition is any definition that uses the thing to be defined as part of the definition. A recursive formula, or function, is a related formula or function. A recursive function uses the function itself in the definition. For example: The factorial function, written n!, is defined as the product of all the numbers, from 1 to the number (in this case "n"). For example, the factorial of 4, written 4!, is equal to 1 x 2 x 3 x 4. This can also be defined as follows: 0! = 1 For any "n" > 0, n! = n x (n-1)! For example, according to this definition, the factorial of 4 is the same as 4 times the factorial of 3. Try it out - apply the recursive formula, until you get to the base case. Note that a base case is necessary; otherwise, the recursion would never end.