I see that the ticket
http://trac.sagemath.org/sage_trac/ticket/4533
has been closed. Thank you for the effort, now divisors in SAGE is
much faster!! However, the one that packed in SAGE 3.2 is still about
3 times slower than that in PARI. I wonder if all the improvements
have been implemented
On Mon, Nov 24, 2008 at 10:43 PM, pong [EMAIL PROTECTED] wrote:
I see that the ticket
http://trac.sagemath.org/sage_trac/ticket/4533
has been closed. Thank you for the effort, now divisors in SAGE is
much faster!! However, the one that packed in SAGE 3.2 is still about
3 times slower than
Oh really.
Now I realized why I had in my mind that SAGE was much slower---the
test what based on a more complicated function instead of just
divisors.
Looking forward to SAGE 3.2.1 then.
On Nov 24, 11:05 pm, William Stein [EMAIL PROTECTED] wrote:
On Mon, Nov 24, 2008 at 10:43 PM, pong [EMAIL
On Nov 15, 2008, at 23:57 , pong wrote:
I was a bit reluctant to post this question here since support
shouldn't mean teaching me how to write programs. But Jason Grout
suggested me to post it here anyway.
It seems reasonable to post this here, since it involves performance,
which can be
On Nov 15, 2008, at 11:57 PM, pong wrote:
I was a bit reluctant to post this question here since support
shouldn't mean teaching me how to write programs. But Jason Grout
suggested me to post it here anyway.
Short snippets of code (like the one below) are very useful. It's
hard to give a
