I guess it is too complicated for sympy (namely, b has two indices and
the equations are not linear), but check out `rsolve`.
On 3 March 2013 02:54, <vadi...@gmail.com> wrote:
> Hi,
> I have a system of recurrent relationships, like the following (simplified
> example):
>
> a = Function('a')
> b = Function('b')
> k = Symbol('k', integer=True)
>
> a(k+1) == b(k+1,k)*a(k) + 2*b(k+1,k)
> b(k+2,k) == b(k+2,k+1)*b(k+1,k)
>
> Is it possible to give these to SymPy and have it automatically figure out
> what (a(k+n) - a(k)) would look like for some arbitrary integer n? I
> don't know what this operation is called in SymPy terms, so no idea where to
> start...
>
> Thanks!
>
> --
> You received this message because you are subscribed to the Google Groups
> "sympy" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to sympy+unsubscr...@googlegroups.com.
> To post to this group, send email to sympy@googlegroups.com.
> Visit this group at http://groups.google.com/group/sympy?hl=en.
> For more options, visit https://groups.google.com/groups/opt_out.
>
>
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sympy+unsubscr...@googlegroups.com.
To post to this group, send email to sympy@googlegroups.com.
Visit this group at http://groups.google.com/group/sympy?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
