On Wednesday 19 September 2007 15:55, William Stein wrote: > Just for clarity, why not just compute the GCD with mathematica?
Well, I am doing that. I assumed that I had found a slow corner case that singular folks would want to fix. I'm not entirely sure that this point how small that corner is ... or whether mathematica and magma are simply much faster with gcd's of this magnitude. Obviously, we would all be happier though if sage was at least in the ballpark for speed on this. It kind of hampers sage as an open source solution for what I'm doing ... it basically means I can only get about 4 numbers in my desired sequence vs. about 7 or 8 probably (but I haven't figured that out quite yet because of other optimization that is needed). -- Joel --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
