Dear John,
nice to hear from you.
[please forward my answer to sage-devel since I'm not sure I'm allowed to post]
> Date: Sat, 30 Oct 2010 14:51:27 +0100
> From: John Cremona
>
> With a few (preferably native English-speaking) people collaborating,
> translating the French book would no
Hi,
the problem with SegFaults under Fedora 12 (#7773) still sucks with 4.3.3, and
makes reviewing patches more difficult. If any Sage developer is attending SD20
we can investigate that together on my laptop.
Paul
PS: I have put links on #7773 to the log of sage -t * and the install log.
he best possible O(M(n)),
where M(n) is the time to multiply two n-bits numbers. Also GMP (and thus MPFR
since it depends on GMP) does not (automatically) do partial computations on
disk.
Paul Zimmermann
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe fr
w function" as explained here:
>
> http://www.mpfr.org/mpfr-current/mpfr.html
>
> In particular, see the rule that "pow(x, ±0) returns 1 for any x, even
> a NaN." Indeed:
>
> sage: RR('NaN')^0
> 1.00
>
> William
>
> -- Willia
also recompile GMP with gcc 4.4.0. Then MPFR will automatically pick
the right compiler.
Paul Zimmermann
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to
sage-devel-unsubscr
Fredrik,
> Thanks for the input. Unfortunately, I don't see how Schönhage's
> factorial algorithm can be adapted to harmonic numbers or Stirling
> numbers, due to the way the partial products need to be summed.
>
> A slight improvement to the plain binary splitting method is to factor
> o
> > I'm curious if anyone here knows of faster algorithms for harmonic
> > numbers / Stirling numbers? This list seems like the right place to
> > ask :-)
>
> I don't know, but hopefully someone will see the bump and respond.
> Paul Zimmermann might be th
Dear Alex,
> Date: Wed, 1 Oct 2008 08:42:27 +1000
> From: "Alex Ghitza" <[EMAIL PROTECTED]>
>
> Dear Paul and Andreas,
>
> Thanks for your help. I noticed the mpc webpage shortly after I wrote the
> initial email. It looks very promising, and since Sage already uses mpfr
> for its real
> Date: Thu, 18 Sep 2008 05:27:23 -0700 (PDT)
> From: David Kohel <[EMAIL PROTECTED]>
>
> Hi,
>
> Cc: Paul for comment on local information.
>
> This (http://www.hotel-eclipse.fr) looks inexpensive but (unless
> I'm mistaken), not accessible to LORIA or the center except by car.
yes indeed.
>
rc5 fails to build on my Pentium M laptop:
gcc -DHAVE_CONFIG_H -I. -I.. -I../src -I../src
-I/tmp/sage-2.10.1.rc5/local/include -g -O2 -fvisibility=hidden -Wall
-Wpointer-arith -MT rijndael.lo -MD -MP -MF .deps/rijndael.Tpo -c rijndael.c -o
rijndael.o >/dev/null 2>&1
make[4]: *** [rijndael.lo]
Hi,
I suggest to present a poster about SAGE at the ANTS VIII conference,
which will happen next May in Banff (deadline for poster abstract is
Monday, and for final submission is February 10:
http://ants.math.ucalgary.ca/poster-session).
Maybe some of you already plan to present such a p
John,
> A variation of this, which would be useful in some elliptic curve
> calculations, would be a function
> RR(x).nearby_rational_whose_denominator_is_a_perfect_square().
>
> For either problem, is there a better solution than going through the
> continued fraction convergents until o
Lehmer five
sequences. The main difficulty is that to compute sigma(n), you have to
factor n. For the current large numbers we encounter (150-160 digits) we use
a combination of different algorithms (ECM, QS, NFS). I have now converted
to SAGE the script that (tries to) extend aliquot sequences. Th
13 matches
Mail list logo
