answersLogoWhite

0


Best Answer

No, patterns with terms that are not based upon previous terms are not recursive.

Example: i * i where i is the nth term of the pattern.

User Avatar

Wiki User

13y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Are all patterns recursive
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Are all recursive programs non recursive?

None of them is, obviously.


What is set difference between recursive and recursively enumerable but not recursive?

All recursive Languages are recursively enumerable. But not all the recursively enumerable languages are recursive. It is just like NP complete.


How many different recursive patterns can you find with 4 and 7 as the first 2 terms?

there are 4 different ways you can do it


What is recursive association?

a recursive association - as a aggregation is a special form of association, so recursive aggregation can be called as recursive association ... AKASH SISODIYA ......IT ...


What does the word recursive mean?

Something that is recursive is something that repeats.


What is the definition of recursive?

The term recursive refers to the recurrence or repetition.


Is 4 9 19 39 79 159 recursive?

no it is not recursive


What does recursive mean?

Recursive refers to using a rule or procedure that can be applied repeatedly.


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.


What is the difference between function and recursive function?

I will explain in the easiest way the difference between the function and recursive function in C language. Simple Answer is argument of the function is differ but in the recursive function it is same:) Explanation: Function int function(int,int)// function declaration main() { int n; ...... ...... n=function(a,b); } int function(int c,int d) { ...... ...... ...... } recursive Function: int recursive(int,int)// recursive Function declaration main() { int n; ..... ..... ..... ..... n=recursive(a,b); } int recursive(int a,int b) { ..... .... .... .... } Carefully see, In the recursive Function the function arguments are same.


How many recursive patterns can you find with 4 plus 7 as the first 2 terms?

Infinitely many. For example: Un+1 = Un + 3 or Un+1 = 2*Un - 1 or Un+1 = 3*Un - 5 or, more generally, Un+1 = k*Un + 7 - 4*k where k is any number. Each one of them will be different from the third term onwards. These are linear patterns. There are quadratic and other recursive relationships.


What is a recursive relationship?

a function that recalls itself again and again is called recursive relationship.