Question 1161033
.


            The problem formulation, strictly saying, is incomplete, since it DOES NOT define for which values of "n" the given formula is valid.


            But if we assume that it is valid for any integer n >= 3, then see my solution below.


            Read it VERY ATTENTIVELY.


            Also notice that the formula is INVALID for n= 2.



<U>Solution</U>


<pre>
It is INCORRECT to call this formula <U>recursive</U>.


There is NO recursion in it.


It is an EXPLICIT formula  f(m) = 3m-4, for any integer m >= 2, if we accept my assumption above.


So, f(2) = 3*2 - 4 = 6 - 4 = 2;

    f(3) = 3*3 - 4 = 9 - 4 = 5;

    f(4) = 3*4 - 4 = 12 - 4 = 8.


You can easily calculate million next terms in this way, if you want.
</pre>

--------------


<U>Very important &nbsp;POST-NOTE</U> :



&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;It is a &nbsp;GROSS &nbsp;MISTAKE &nbsp;to call this formula recursive (!)