I've been meaning to get around to pointing these out: http://trac.sagemath.org/sage_trac/ticket/468
http://trac.sagemath.org/sage_trac/ticket/486 The first contains a patch to fix the problem where quad_double screws up the fpu precision on x86 machines, and the second contains a patch to significantly speed up number_of_partitions() (the second patch won't work properly unless the first patch is applied, though.) The main reason that I haven't really pointed the patches out is that I haven't tried them on a recent version of sage, and they definitely need to be tested on a few different machines before they are included in sage, because I'm not sure if the code will work on all computers. The speedup is quite significant, though, and any problems should be minor. (By the way, the next thing to do, of course, is to to put in support for bigger numbers. Right now it is limited to at most the size of an int, and I'm not actually sure if it works correctly for large ints. Maybe I should add a trac ticket for this, but, then again, is there any chance that anyone would ever really care enough to let a computer spend a week, or however long it would take, calculating the number of partitions of, say, 10^100?) On Fri, 2007-10-12 at 09:14 -0700, William Stein wrote: > Jon, > > Is there an update on your number_of_partitions code? > > I'm going to give a plenary talk at an AMS meeting tomorrow, > and your fast number_of_partitions code will be one of > my examples. I had the feeling you were about to release > a version that was faster than the one in Sage a month or > two ago, but somehow it didn't happen. > > William > --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
