2007/8/10, Justin <[EMAIL PROTECTED]>:
>
> Hi again everyone,
>
> I'm playing around with this project exploring Hasse's theorem for
> Elliptic Curves over prime order field and playing with the
> distributions that I get. The bottom line is that I execute alot of
> lines like this:
>
> -----------
> sage: P=prime_range(8000,9000)
> sage: L=[EllipticCurve(GF(i),[0,-1,1,0,0]) for i in P]
> sage: E=[L[i].cardinality() for i in range(len(P))]
> -----------
How much memory do you have on your machine? I on my a machine with
784 MB of memory,I can do:
{{{
sage: P=prime_range(8000,15000)
sage: L=[EllipticCurve(GF(i),[0,-1,1,0,0]) for i in P]
sage: E=[L[i].cardinality() for i in range(len(P))]
}}}
without any problems
didier
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to sage-support@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-support
URLs: http://sage.math.washington.edu/sage/ and http://sage.scipy.org/sage/
-~----------~----~----~----~------~----~------~--~---
