I just found this on http://reference.wolfram.com/mathematica/note/SomeNotesOnInternalImplementation.html:
"PartitionsP[n] uses Euler's pentagonal formula for small n, and the non-recursive Hardy-Ramanujan-Rademacher method for larger n." --Mike On 7/26/07, Alec Mihailovs <[EMAIL PROTECTED]> wrote: > > From: "Mike Hansen" <[EMAIL PROTECTED]> > > > I'm not sure where the bottleneck in PARI is since I can't imagine > > Mathematica uses a different method to compute the number of > > partitions. > > I don't know what is used in the latest Mathematica version, but originally > NumberOfPartitions function in the Combinatorica package used the recursion > with pentagonal numbers, see > > http://www.cs.uiowa.edu/~sriram/Combinatorica/NewCombinatorica.m > > Alec > > > > > --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
