Hi again,
On 2018-12-07, slelievre wrote:
> There's competition between the words "recursion" and "recurrence",
> you might have had more luck with "recurr".
I'll try to do search_def("recur"), then.
However:
> This should be possible using either SymPy, or FriCAS,
> or the optional "Ore
Hi Samuel,
thank you for all the links!
Best regards,
Simon
On 2018-12-07, slelievre wrote:
> Fri 2018-12-07 13:56:34 UTC+1, Simon King:
>
>> Let x_0 be given, let f be a function defining a sequence (x_0,x_1,...)
>> recursively by x_{n+1}=f(x_n).
>>
>> Is there a tool in Sage that can (at
Fri 2018-12-07 13:56:34 UTC+1, Simon King:
> Let x_0 be given, let f be a function defining a sequence (x_0,x_1,...)
> recursively by x_{n+1}=f(x_n).
>
> Is there a tool in Sage that can (at least in sufficiently simple cases)
> deduce a closed formula for x_n? I tried search_def('recurs'), but
Hi!
Let x_0 be given, let f be a function defining a sequence (x_0,x_1,...)
recursively by x_{n+1}=f(x_n).
Is there a tool in Sage that can (at least in sufficiently simple cases)
deduce a closed formula for x_n? I tried search_def('recurs'), but it
revealed nothing I could recognise.
Best
Le jeudi 6 décembre 2018 17:28:39 UTC+1, Tevian Dray a écrit :
>
> >> The answer to your question is essentially "yes" ...
>
> Thank you for your detailed response and links. I had in fact found
> some of them when searching, but clearly hadn't read them carefully
> enough. In particular, I
