A function is defined for all values of such that: ( ) = ( ) + ( ) and the first two values, ( ) and ( ) are arbitrarily chosen (they can take any value). What is the sum of all the possible fundamental periods of the function? [i.e. 1,2,3,1,2,3.... has a cycle of 3) ? (For example, if the function can have cycles of period 1,2 and 3, then the sum would be 6)
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Calculate the first 12 terms of the series generated by the recurrence, for arbitrary initial values of f ( 1 ) and f ( 2 ) , called a and b respectively. I used the Python sympy symbolic algebra library.
If the initial two terms are zero then all terms are zero. Otherwise, the cycle is of length six.