#17157: Improve formula for Bell numbers
-------------------------------------+-------------------------------------
Reporter: jdemeyer | Owner:
Type: enhancement | Status: needs_review
Priority: minor | Milestone: sage-6.4
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jeroen Demeyer | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jdemeyer/ticket/17157 | 0266cef42895b095b8c7eca5718a1466300e1304
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by fredrik.johansson):
Which reminds me that flint is missing two tricks: firstly, batch
computing all the powers {{{1^n, 3^n, 5^n, ..., N^n}}} using sieving (one
multiplication for every odd index, then one shift for every even index),
and secondly, only working with approximate values of the powers near the
end of that list.
The first trick would use much more memory, of course, but that's fine as
one can fall back to the multimodular algorithm for very large n anyway.
--
Ticket URL: <http://trac.sagemath.org/ticket/17157#comment:11>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" 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 http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
