On 2018-12-09, Marc Mezzarobba <m...@mezzarobba.net> wrote: > Simon King wrote: >> What about >> a more complicated recurrence, such as the one given by >> x_(n+1) = 1 + x_n*2/n >> Any chances to solve those and similar recurrences automatically? > > You can try sympy's rsolve() or Maxima's solve_rec(). I don't know how > powerful they are.
Hi Marc, I had a look and it seems that it is doing what I was looking for. Thank you for the hint! Coincidentally, William Stein today advertised a multi author book on doing computations with Sage, and it has a chapter on solving recurrences, also pointing to sympy. Best regards, Simon -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To post to this group, send email to sage-support@googlegroups.com. Visit this group at https://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
