What would you like to do?

# How do you write a recursive rule for a sequence?

Would you like to merge this question into it?

#### already exists as an alternate of this question.

Would you like to make it the primary and merge this question into it?

# Write a program which employs Recursion?

include    int factorial(int n){   if(n 0 || n 1)   return 1;   return n*factorial(n-1);   }    int main(int argc, char *argv[]){

# Write a example of recursion?

Following function calculates factorial of a number using recursion.   unsigned int factorial(unsigned int a) { if (a == 1) return 1; else { a *= factorial(a-1)

# How do you write a recursive Formula?

3,6,9,12 A sub 1 = First (3) a sub n = a sub (n-1) + change (3)

# Recursive rule for the Fibonacci sequence?

  x1=0 x2=1 for i > 2, xi= xi-1 + xi-2

# What is a recursive rule?

A recursive rule is one which can be applied over and over again to its own output

# How do you do recursive pattern rule?

a recursive pattern is when you always use the next term in the pattern... for example   4,(x2+1) 9,(x2+1) 19,(x2+1) 39,(x2+1) 79,(x2+1) 159

# Can a recursive formula produce an arithmetic or geometric sequence?

arithmetic sequence * * * * * A recursive formula can produce arithmetic, geometric or other sequences. For example, for n = 1, 2, 3, ...: u0 = 2, un = un-1 + 5 is an arithmet

# What is a recursive rule in math?

It is a term for sequences in which a finite number of terms are defined explicitly and then all subsequent terms are defined by the preceding terms. The best known example i

# How do you write recursive algorithm?

Any algorithm, that refers to itself is recursive. Trivial example: gcd (a, b) := a if b=0 b if a=0 gcd (a mod b, b) if a>=b gcd (b mod a, a) if a<b

# Write a program to generate the Fibonacci sequence recursively and non recursively?

In c: int fibr(int n) { // Find nth Fibonacci number using recursion. if (n

# How do you find a recursive rule?

You can search on ebay or more likey to find at Staples :)

# How is the recursive form of a sequence sometimes more useful than the closed form where a rule is found to find any term based on its position in the sequence?

"The recursive form is very useful when there aren't too many terms  in the sequence. For instance, it would be fairly easy to find the  5th term of a sequence recursively,

# How are recursive rules same from explicit function rules?

The question does not make sense. " Same as" would mean you want to know what the similarities are. "Different from " would mean you want to know how they are different. H

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

The two are totally unrelated. .

# Which is the recursive formula for the nth term in a geometric sequence?

You need to know two numbers to completely describe the geometric sequence: the starting number, and the ratio between each number and the previous one. When you use recursi

# How do you write the rule for a sequence?

You can write it as U n or f(n) equal to some function of n, where the function can be anything at all.
In Uncategorized

true