On Sun, 23 Oct 2011 15:09:09 -0700 (PDT) Simon King <[email protected]> wrote:
> On 23 Okt., 23:18, David Joyner <[email protected]> wrote: > > On Sun, Oct 23, 2011 at 4:51 PM, Avril Coghlan > > > > <[email protected]> wrote: > > > Dear all, > > > > > I am new to SAGE (since today) but am excited about learning how > > > to use it! > > > > > I'm wondering is it possible to use SAGE to find the close form > > > for a linear second order recurrence sequence? > > > For example, can SAGE find a closed form for an equation such as: > > > u_{n+2} = 2 * u_{n+1} + 8 * u_{n}, where we know u_{0} = 2 and > > > u_{1} = 7 ? > > > > > I will be very grateful for any help, or if you can point me > > > towards the right documentation page to look at. > > > > Your question might be addressed in this sage-support > > thread:http://www.mail-archive.com/[email protected]/msg17045.html > > Probably the thread is answering Avril's question. > > But the last post in the thread is Nathann saying: > """ > Should we create a ticket for this ? I'd have done it if not for my > doubt on the section I should pick for this... :-) > """ > > Is there a ticket? http://trac.sagemath.org/sage_trac/ticket/1291 Cheers, Burcin -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
