Wow, that's great news! I missed the incorporation of flint.
1. Is there up-to-date documentation about flint being used in sympy
anywhere? I see your blog post
https://oscarbenjamin.github.io/blog/czi/post2.html
but it would be nice to have something in the official docs.
2. Is it worth fixing t
Is there any interest in improving SymPy's handling of sequences as a GSoC
project? As a mathematics student, I often find myself checking identities
involving well-known, recursive sequences and their generating functions.
When
I use SymPy to do this I always end up cobbling together something th
Why do we assume that g'(t).diff(g(t)) == 0?
Here's a question on math.SE about derivatives w.r.t.
functions: https://math.stackexchange.com/questions/954073
Does the assumption work with the accepted answer there?
On Wednesday, August 29, 2018 at 2:12:07 AM UTC-4, Aaron Meurer wrote:
>
> I be
the variables. This can easily be turned back into a function
> using Lambda, but going from Python function to SymPy expression isn't
> always possible.
>
> Aaron Meurer
>
> On Mon, Aug 27, 2018 at 4:38 PM, Robert Dougherty-Bliss
> > wrote:
> > Can you
r's guide.)
On Monday, August 27, 2018 at 5:27:23 PM UTC-4, Aaron Meurer wrote:
>
> That looks like a good start. I would try to represent the sequence
> symbolically instead of via a function so that it can be manipulated.
>
> Aaron Meurer
>
> On Mon, Aug 27, 2018 at 2
recurrences, there has been some work in
> the new sympy.discrete.recurrences submodule.
>
> Making SeqBase support recursive sequences sounds like a good idea.
> One would need to make sure that all the methods work properly when
> the sequence is recursive.
>
> Aaron Meurer
>
&
I have recently been working with linear recurrence relations with constant
and / or polynomial coefficients w.r.t. the index. (These are called
C-finite and P-recursive sequences, respectively.) These sequences have
some nice properties, such as easy closed-form expressions in the C-finite
cas
