[Jprogramming] arithmetic sequence

[Bo Jacoby]

Alessandros problem was "writing a functions that returns an array of shape 
equals to N 2 where the n-th row contain the 2 coefficents of the n-th 
term of the sequence". That problem was immediately solved using    ^:  .  The closed form solution to a recurrence has the advantage that you don't need to compute all the intermediate values in order to compute a final value. So if you do not want all the intermediate values, but only the final value, then the closed form is a shortcut, saving a lot of time. If you do want all the intermediate values, then the closed form is not a shortcut. 
- Bo




>________________________________
> Fra: Boyko Bantchev <boykobb at gmail.com>
>Til: programming at jsoftware.com 
>Sendt: 21:38 søndag den 23. december 2012
>Emne: Re: [Jprogramming] arithmetic sequence
> 
>On 23 December 2012 21:21, Bo Jacoby <bojacoby at yahoo.dk> wrote:
>> Other data give other conclusions.
>
>The ‘otherness’ of your ‘other data’ is that it is unrelated to the
>problem posed by Alessandro and discussed by Skip and
>everybody else in this thread.
>----------------------------------------------------------------------
>For information about J forums see http://www.jsoftware.com/forums.htm
>
>