0
3,6,9,12
A sub 1 = First (3)
a sub n = a sub (n-1) + change (3)
Wiki User
∙ 13y ago
Add your answer:
Earn +20 pts
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.
Why recursive solution is better for tree traversal?
Because a tree is a recursive data-structure. It's easier to write (and easier to understand) a recursive program for handling it.
Jntu 2-2 oops through java answers?
write a java program to find factorial using recursive and non recursive
What is the recursive formula for 2 1 3 4 7 11?
It look like a Fibonacci sequence seeded by t1 = 2 and t2 = 1. After that the recursive formula is simply tn+1 = tn-1 + tn.
What is the recursive formula for 64 to 16 to 4 to 1?
x_n+1 = x_n / 4
What is is a recursive formula?
A recursive formula is one that references itself. The famous example is the Fibonacci function: fib(n) := fib(n-1) + fib(n-2), with the terminating proviso that fib(0) = 0 and fib(1) = 1.
Write a c program to find GCD of two given integers by using both recursive n non recursive functions?
i love u darling
What recursive formulas represents the same arithmetic sequence as the explicit formula an 5 n - 12?
-7
What is the recursive formula for this geometric sequence 4-1236-108...?
4, -1236, -108 is not a geometric system.
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.
