Hello,
the following issue is related to #519: malb created deallocation
routines for the random state used by the Mersenne Twister in the gmp.
We used to have many states leaked (about 40 in a usual session), but
that has been fixed. To my surprise we still leak one state:
==32085== 2,500 bytes
factor is a general factoring function for integers, polynomials and
various other types. It also takes an optional parameter to tell it
how many primes to use in the factorisation. So for example if you
want to know all prime factors of an integer up to 1000 you'd use
factor(n, 1000).
factorint
factorint and factor is not the same thing. factorint allows you to
specify various parameters for the factorisation. For example you can
select which of the various factorisation algorithms are used by Pari
to split your integer. You can also pass an integer to the factor
functions telling you up
Here are the remaining timings for Pari vs Magma for computing class
groups.
Executive summary: Magma eventually catches up with Pari and overtakes
it for some computations. Basically Magma doesn't like large
discriminants.
As before, four dots means Magma took too long and I killed it:
Degree,
Just finished sage -upgrade, and saw the following flash by near the end:
Machine:
Linux fermat 2.6.20-16-generic #2 SMP Fri Aug 31 00:55:27 UTC 2007
i686 GNU/Linux
sage: cvxopt-0.8.2.p1 is already installed
1559.70user 110.37system 30:40.57elapsed 90%CPU (0avgtext+0avgdata
0maxresident)k
0inputs
Making sure this gets to sage-devel...
-- Forwarded message --
From: Karim Belabas <[EMAIL PROTECTED]>
Date: Sep 7, 2007 1:37 PM
Subject: Re: bug in isprime()
To: John Cremona <[EMAIL PROTECTED]>
Cc: Pari Developers <[EMAIL PROTECTED]>, sage-devel@googlegroups.com
* John Cremona
Thanks for the clear explanation (I do know about Pocklington-L and so
on). IN fact Bill Hart had already proposed this as the explanation
to sage-dev.
As you may have guessed, sage-dev are getting concerned about having
all its results provably valid (possibly after turning on some
"proof=trye
Hi,
SAGE-2.8.4 -- a "mega bugfix release" (70 tickets closed since 2.8.3.6)
has been released:
http://sagemath.org
or
sage -upgrade
Binaries will come in 2-3 days.
This release is another one that concentrates on fixing bugs and
increasing the doctests coverage. Many people contributed an
I *think* this one will be OK. The call to the factoring algorithm is
probably just to look for small factors and for perfect powers. It's
mainly done for efficiency reasons I think.
I noticed this too, but decided it was probably OK (pun intended).
Bill.
On 7 Sep, 20:51, "John Cremona" <[EMAIL
John Cremona wrote:
> It gets worse: (with GP/PARI 2.4.2):
>
> ? default(debug,2)
> %5 = 2
> ? p=nextprime(10^20)
> %6 = 10039
> ? isprime(p)
> *** isprime: Warning: IFAC: untested integer declared prime.
> 507526619771207
> %7 = 1
>
> -- so one call to isprime(), whic
Running this version:
GP/PARI CALCULATOR
Version 2.4.2 (development CHANGES-1.1844)
i686 running
linux (ix86 kernel) 32-bit version
compile
It gets worse: (with GP/PARI 2.4.2):
? default(debug,2)
%5 = 2
? p=nextprime(10^20)
%6 = 10039
? isprime(p)
*** isprime: Warning: IFAC: untested integer declared prime.
507526619771207
%7 = 1
-- so one call to isprime(), which supposedly proves a proof, involves
furthe
The number field code in Pari relies on factoring the discriminant
often using MPQS. In particular if you turn debugging mode on, you get
warnings like this:
*** bnfclassunit: Warning: IFAC: untested integer declared prime.
10762727634633706239259776012492757340083
So basically the num
On 9/7/07, John Cremona <[EMAIL PROTECTED]> wrote:
>
> As a first attempt I was going to add the isprime() test to the
> factors returned and just output a warning if one of them fails. I
> guess that pari-dev would be interested in such examples anyway.
>
> BTW, not sure how I am supposed to pro
As a first attempt I was going to add the isprime() test to the
factors returned and just output a warning if one of them fails. I
guess that pari-dev would be interested in such examples anyway.
BTW, not sure how I am supposed to provide patches to mwrank source
code except by emailing the chan
On 9/7/07, Hamptonio <[EMAIL PROTECTED]> wrote:
>
> Thanks guys. I can't use the notebook anyway from that machine, I
> would be running pre-written scripts to do heavy calculations. It got
> far enough that I am hopeful I can get it to where it does what I
> need.
>
Please post anything you fi
William, the trac ticket should read > 10^15, not < 10^15.
Bill.
On 7 Sep, 18:23, "William Stein" <[EMAIL PROTECTED]> wrote:
> On 9/7/07, John Cremona <[EMAIL PROTECTED]> wrote:
>
> > On 9/7/07, Bill Hart <[EMAIL PROTECTED]> wrote:
> > > Are there other algorithms available in SAGE from Pari tha
On 7 Sep, 08:55, "John Cremona" <[EMAIL PROTECTED]> wrote:
> The pari manual says (about factor(x)):
>
> If $x$ is of type integer or rational, the factors are \var{pseudoprimes}
> (see \kbd{ispseudoprime}), and in general not rigorously proven primes. In
> fact, any factor which is $\leq 10^{15
On Sep 7, 8:04 pm, Hamptonio <[EMAIL PROTECTED]> wrote:
> Thanks guys. I can't use the notebook anyway from that machine, I
> would be running pre-written scripts to do heavy calculations. It got
> far enough that I am hopeful I can get it to where it does what I
> need.
>
> Cheers,
> Marshall
Thanks guys. I can't use the notebook anyway from that machine, I
would be running pre-written scripts to do heavy calculations. It got
far enough that I am hopeful I can get it to where it does what I
need.
Cheers,
Marshall
On Sep 7, 11:10 am, mabshoff <[EMAIL PROTECTED]
dortmund.de> wrote:
>
Hello folks,
Okay, Sage's Bug Day is over. Many tickets were fixed, but I am not
writing a genral summary, but will concentrate on the memleak
situation: We made much progress, we in this case being burcin, malb,
robertwb, wstein and mabshoff. I am hoping that I did not leave
anybody working on t
On 9/7/07, John Cremona <[EMAIL PROTECTED]> wrote:
> On 9/7/07, Bill Hart <[EMAIL PROTECTED]> wrote:
> > Are there other algorithms available in SAGE from Pari that rely on
> > conjectures? This would include the stuff for totally real fields that
> > relies on the Stark conjectures.
>
> mwrank us
On Sep 7, 7:00 pm, Hamptonio <[EMAIL PROTECTED]> wrote:
> Hi,
>
> I am hoping to use sage on some supercomputers and/or clusters.
> Currently I am trying to compile it on the IBM Power4 machine at the
> Minnesota Supercomputing Center (seehttp://www.msi.umn.edu/power4/index.html
> for some detai
On 9/7/07, Hamptonio <[EMAIL PROTECTED]> wrote:
> I am hoping to use sage on some supercomputers and/or clusters.
> Currently I am trying to compile it on the IBM Power4 machine at the
> Minnesota Supercomputing Center (see http://www.msi.umn.edu/power4/index.html
> for some details on that). It
Hi,
I am hoping to use sage on some supercomputers and/or clusters.
Currently I am trying to compile it on the IBM Power4 machine at the
Minnesota Supercomputing Center (see http://www.msi.umn.edu/power4/index.html
for some details on that). Its about 300 Power4 processors running
AIX.
I just
On 9/7/07, Bill Hart <[EMAIL PROTECTED]> wrote:
>
>
> Are there other algorithms available in SAGE from Pari that rely on
> conjectures? This would include the stuff for totally real fields that
> relies on the Stark conjectures.
mwrank uses the pari library for factorization of integers, so the
26 matches
Mail list logo
