Hello,
A review on the ticket would be great
http://trac.sagemath.org/ticket/15003. Thanks.
On Sat, Feb 15, 2014 at 7:14 AM, Amit Jamadagni wrote:
> Hello,
> I have tried to resolve the issue. Any comments would be helpful.
> Thanks.
>
>
> On Fri, Feb 14, 2014 at 4:31 AM, Volker Bra
I had some troubles running the buildbot slave through systemd. You service
will be selinux confined and some doctests with external programs fail on
Fedora 20. Nothing particularly important afair.
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group
On 2/17/14 11:09 AM, William Stein wrote:
On Mon, Feb 17, 2014 at 9:07 AM, Jason Grout
wrote:
On 2/15/14 11:44 PM, Henry de Valence wrote:
This approach requires systemd and is Linux-specific, but as every major
Linux distribution is either using systemd now or plans to move to it in
the futu
On Mon, Feb 17, 2014 at 9:07 AM, Jason Grout
wrote:
> On 2/15/14 11:44 PM, Henry de Valence wrote:
>>
>> This approach requires systemd and is Linux-specific, but as every major
>> Linux distribution is either using systemd now or plans to move to it in
>> the future, it seems like it might be wor
On 2/15/14 11:44 PM, Henry de Valence wrote:
This approach requires systemd and is Linux-specific, but as every major
Linux distribution is either using systemd now or plans to move to it in
the future, it seems like it might be worthwhile for Sage to ship
systemd .service files for Linux users.
Henry de Valence writes:
> Hi all,
>
> while looking at the SAGE FAQ here [1], I noticed the link to Trac #381 [2]
> (the link is broken, on the FAQ page, though).
>
> One option which is not mentioned, but which is extremely convenient,
> is to run Sage using a systemd user session. The Arch Linu
Hi Jori,
> Date: Mon, 17 Feb 2014 14:56:56 +0200 (EET)
> From: Jori Mantysalo
>=20
> On Mon, 17 Feb 2014, Zimmermann Paul wrote:
>=20
> > On my computer, computing gamma(Pi^2) to 1 bits takes about 1.4s (f=
or the
> > first computation, when Bernoulli numbers are not cached) instead of
On Mon, 17 Feb 2014, Zimmermann Paul wrote:
On my computer, computing gamma(Pi^2) to 1 bits takes about 1.4s (for the
first computation, when Bernoulli numbers are not cached) instead of 6.1s with
Pari/GP.
Out of curiosity: How this compares to, for example, Mathematica?
--
Jori Mäntysalo
a last update: MPFR now uses the Von Staudt=E2=80=93Clausen theorem to comp=
ute
Bernoulli numbers (thanks to Fredrik Johansson for pointing out this formul=
a).
On my computer, computing gamma(Pi^2) to 1 bits takes about 1.4s (for t=
he
first computation, when Bernoulli numbers are not cached)
