Best Math Formula website. Search anything about Math Formula in this website.
whats a recursive equation. In other words through recursive formula we find the next terms of the sequence one by one. Sequences can have the same formula but because they start with a different number they are different patterns.
Special rule to determine all other cases An example of recursion is Fibonacci Sequence. Thus this is the main difference between recursive and explicit. In a recursive formula each term is defined as a function of its preceding term s.
It is defined like this.
A 1 1 a 2 1 a n a n 1 a n 2 for n 2. The first part tells us the first term of the sequence. These are called seed values. A recursive formula is a formula that requires the computation of all previous terms in order to find the value of a n.