Additional Note: Implementing this would require knowledge of Number Theoretic Transform to solve it optimally in O(k*lg(k)*lg(k) + k*lg(k)*lg(n)) for prime fields. Although there is a simpler sub-optimal solution which can solve this in O(k*k*lg(n)). Generalising for other fields will be more involved though.
On Thursday, February 15, 2018 at 7:24:55 PM UTC+5:30, Sidhant Nagpal wrote: > > As it is difficult to obtain closed form expressions of these type of > recurrences for higher order (k), > support can be added to evaluate them for arbitrary values of n (possibly > in a field). > > For example: consider recurrence of order k=1000, > f(n) = f(n-999) + f(n-1000), for large n, with given initial conditions > f(i) for i < 999. > -- 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 [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/b38460a3-a9b3-4953-a542-6b62e121115e%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
