Hi all,
does somebody know if there is already a Cython code for Goldwasser-
Kilian/ Atkin-Morain (primality proving using elliptic curves) in
SAGE? I heard that SAGE currently imports PARI code for that. In case
there's no Cython code, I'd like to contribute those algorithms.
Thanks, Georg
--
T
Hi
while calculating the integer part of square roots I realized that
sqrt() returns wrong results for large inputs (although the sqrt()
command itself accepts "bignum" values).
example: int(sqrt(2^94533))
I guess that this is due to the fact that SAGE simplifies the
expression above as sqrt(2) *
Hi,
in order to get a root of the hilbert class polynomial mod p (p prime,
D a fundamental discriminant), I am currently using the code lines
S = hilbert_class_polynomial(D);
j = S.roots(GF(p))[0][0];
Is there a (fast) way to compute the hilbert class polynomial directly
mod p in SAGE (thus avoi
Hi,
I wrote a function using the sage notebook (not on sagenb.org but a
local sage build). As the function is quite slow when using it from
within the notebook, I was wondering if it is possible to access the
worksheet containing the function from the sage interactive shell
(e.g. by something like
Thanks for the link and your help! If avoiding the preparser just
consists in putting a "%python" in the first line and starting the
timing from another cell, then I already did that. But still the
notebook is quite slow in my opinion.
Instead, I saved the code as a .py file and loaded it via "load
up with an example by the end of this week (I will contribute
the code anyways soon)
On 12 Dez., 22:43, Mitesh Patel wrote:
> On 12/11/2010 07:18 AM, Jeroen Demeyer wrote:
>
> > On 2010-12-11 14:10, G Hahn wrote:
> >> Thanks for the link and your help! If avoiding the preparser
up with an example by the end of this week (I will contribute
the code soon anyways)
On 12 Dez., 22:43, Mitesh Patel wrote:
> On 12/11/2010 07:18 AM, Jeroen Demeyer wrote:
>
> > On 2010-12-11 14:10, G Hahn wrote:
> >> Thanks for the link and your help! If avoiding the preparser
Hi,
recently, I went through the same steps on
http://www.sagemath.org/doc/developer/walk_through.html
My question on that would be: in case I add a new functionality to
Sage (...I didn't change any existing Sage files or code), where in
the Sage folder shall I place my file "file.spyx" (containin
Hi,
could someone please have a look at this question concerning .py
and .spyx files:
In the sage shell, I am able to load an own program via "load
file.py" (in this case no compiling is done) or via "load
file.spyx" (the file is now compiled and runs faster). Recently, I
added my file to sage/sage
Hi!
Ticket #10562 has just been added on trac.sagemath.org. It provides
primality proving via Goldwasser-Kilian and Atkin-Morain (ECPP) as new
functionality to sage. Reviews appreciated.
Thanks,
Georg
(This is my first ticket. I hope I did everything right...)
--
To post to this group, send an
Hi!
Ticket #10562 has just been added on trac.sagemath.org. It provides
primality proving via Goldwasser-Kilian and Atkin-Morain (ECPP) as new
functionality to sage. Reviews appreciated.
Thanks,
Georg
(This is my first ticket. I hope I did everything in a right way...)
--
To post to this group,
Thanks for your help!
On 5 Jan., 04:46, Kwankyu Lee wrote:
> Hi,
>
> .sage and .spyx files are intended for end users while the library
> files should be .py or .pyx files.
>
> Kwankyu
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an
Thanks! It worked...
On 7 Jan., 06:01, William Stein wrote:
> On Wed, Jan 5, 2011 at 12:03 PM, G Hahn wrote:
> > Thanks for your help!
>
> When you add a .pyxfile, you will also have to edit
> SAGE_ROOT/devel/sage/module_list.py to get "sage -b" to recognize it.
&g
Hi,
the sage reference on
http://www.sagemath.org/doc/reference/sage/schemes/elliptic_curves/constructor.html
reads that the EllipticCurve constructor can either be used with N
prime (>> EllipticCurve(GF(N), [a, b])) or with N composite (>>
EllipticCurve(Zmod(N),[a,b])), where [a,b] are the curve
se of 49 does not exist (characteristic = 91 = 7*13)
>
> as does 5*P.
>
> John
>
> On 16 January 2011 02:59, Robert Bradshaw
> wrote:
>
> > On Sat, Jan 15, 2011 at 4:20 PM, G Hahn wrote:
> >> Hi,
>
> >> the sage reference on
> >>
15 matches
Mail list logo