On Mon, Nov 15, 2010 at 5:45 PM, Dr. David Kirkby
wrote:
> I've noticed two issues with random_prime() in Sage.
>
> 1) Whilst Sage's random_prime() looks as though it will work for numbers to
> at least 10^1, if one specifies a lower bound, then the upper bound
> reduces to 2^40, which is
l...@reviews by WRI bigwigs
On Mon, Nov 15, 2010 at 11:28 AM, Dr. David Kirkby
wrote:
> I thought this might interest some.
>
> dave
>
> Original Message
> Subject: Mathematica Version 8--now available
> Date: Mon, 15 Nov 2010 13:23:02 -0600
> From: Jennifer Peterson
> To: dav
On 11/15/2010 8:54 PM, Robert Bradshaw wrote:
On Sun, Nov 14, 2010 at 11:45 AM, Dr. David Kirkby
wrote:
On 11/14/10 07:00 PM, Tim Daly wrote:
I find it amusing that mathematicians are being told that
a math-specific language is a liability. Mathematics is,
after all, a specialized language
On 11/15/2010 08:54 PM, François Bissey wrote:
> Ross Kyprianou wrote:
>> Thought you might like to know that sage-4.6.1.alpha1 built with no
>> probs but
>> alpha2 failed to build on Ubuntu 10.10 (linux 2.6.35-23-generic)
>> (PC = 2GB Ram, Intel Pentium 4 CPU 3.2GHz)
>>
>> Error was...
>> make[2]:
On Nov 15, 3:06 am, "Dr. David Kirkby"
wrote:
> There are to my knowledge a few problems with making binaries with Sage
>
> 1) It is slow
>
> 2) It fails to work on Solaris, unless on installs the GNU binutils and uses a
> GNU version of 'cp'
>
> 3) A minor point, but this bit of code
>
> TARGET=`
> Thought you might like to know that sage-4.6.1.alpha1 built with no
> probs but
> alpha2 failed to build on Ubuntu 10.10 (linux 2.6.35-23-generic)
> (PC = 2GB Ram, Intel Pentium 4 CPU 3.2GHz)
>
> Error was...
> make[2]: *** [all] Error 2
> make[2]: Leaving directory `/home/kyprir/sage-4.6.1.alph
Thought you might like to know that sage-4.6.1.alpha1 built with no
probs but
alpha2 failed to build on Ubuntu 10.10 (linux 2.6.35-23-generic)
(PC = 2GB Ram, Intel Pentium 4 CPU 3.2GHz)
Error was...
make[2]: *** [all] Error 2
make[2]: Leaving directory `/home/kyprir/sage-4.6.1.alpha2/spkg/build/
e
On 11/15/2010 07:55 PM, Dr. David Kirkby wrote:
> Thank you John. I forgot that had been fixed. I noticed that the
> buildbot failed on t2 to build a binary
Are you referring to fulvia's binary builder 'SunOS 5.10-32 bin
(fulvia)'? This fails to build ATLAS with SAGE_FAT_BINARY=yes. Do you
have
On 11/15/10 07:03 PM, John H Palmieri wrote:
On Nov 15, 3:06 am, "Dr. David Kirkby"
wrote:
There are to my knowledge a few problems with making binaries with Sage
1) It is slow
2) It fails to work on Solaris, unless on installs the GNU binutils and uses a
GNU version of 'cp'
Is this still tr
On Sun, Nov 14, 2010 at 11:45 AM, Dr. David Kirkby
wrote:
> On 11/14/10 07:00 PM, Tim Daly wrote:
>>
>> I find it amusing that mathematicians are being told that
>> a math-specific language is a liability. Mathematics is,
>> after all, a specialized language that took me years to
>> learn.
Creati
On Nov 15, 6:40 pm, John H Palmieri wrote:
> On Nov 13, 6:45 pm, kcrisman wrote:
>
> > Maxima has a very large number of very specific types of
> > simplifications/expansions. It allows for quite a bit of control.
> > That said, the main reason our Maxima stuff is slow is because we use
> > 'p
I've noticed two issues with random_prime() in Sage.
1) Whilst Sage's random_prime() looks as though it will work for numbers to at
least 10^1, if one specifies a lower bound, then the upper bound reduces
to 2^40, which is about 10^12.
This situation does *not* change if one specifies
On Nov 13, 6:45 pm, kcrisman wrote:
> Maxima has a very large number of very specific types of
> simplifications/expansions. It allows for quite a bit of control.
> That said, the main reason our Maxima stuff is slow is because we use
> 'pexpect' to communicate with it. Nils Bruin has a patch all
On Nov 15, 1:01 pm, John H Palmieri wrote:
> On Nov 14, 11:42 pm, William Stein wrote:
>
>
>
>
>
> > On Sun, Nov 14, 2010 at 6:26 AM, John Cremona
> > wrote:
> > > Something is not quite right in the cleverness used to output matrices:
>
> > > sage: M
> > > 76 x 58 dense matrix over Integer R
On 2010-11-15 17:23, Dr. David Kirkby wrote:
> But surely if a bug is found, it should be on trac.
Should a PARI bug be on the Sage Trac? What's the point if it already
was reported to PARI?
Anyway, if you want you can go ahead and make the ticket but there is
not much we can do anyway besides w
On Nov 15, 10:56 am, Ben Goodrich wrote:
> Thanks for the tip, which seems to have worked. I opened a ticket
> (10268), attached my patch, and uploaded a benchmark.
Now I have a un-minimal example of using GiNaC's normal function that
finishes in about 1 minute when done directly in the GiNaC she
On Nov 14, 11:42 pm, William Stein wrote:
> On Sun, Nov 14, 2010 at 6:26 AM, John Cremona wrote:
> > Something is not quite right in the cleverness used to output matrices:
>
> > sage: M
> > 76 x 58 dense matrix over Integer Ring (type 'print M.str()' to see
> > all of the entries)
> > sage: M.he
I thought this might interest some.
dave
Original Message
Subject: Mathematica Version 8--now available
Date: Mon, 15 Nov 2010 13:23:02 -0600
From: Jennifer Peterson
To: david.kir...@onetel.net
Wolfram is pleased to inform you that the latest version of its
flagship computa
On Nov 15, 3:06 am, "Dr. David Kirkby"
wrote:
> There are to my knowledge a few problems with making binaries with Sage
>
> 1) It is slow
>
> 2) It fails to work on Solaris, unless on installs the GNU binutils and uses a
> GNU version of 'cp'
Is this still true? For a while now, sage-bdist has us
On 11/15/10 12:01 PM, Jeroen Demeyer wrote:
On 2010-11-15 12:06, Dr. David Kirkby wrote:
There are to my knowledge a few problems with making binaries with Sage
5) It is way too verbose. I have a log file of sage -bdist which is
12MB in size!
I suspect a lot of that is due to tar being used
On 11/15/10 04:03 PM, Jeroen Demeyer wrote:
On 2010-11-15 16:48, luisfe wrote:
About this problem. Should one open a new ticket or reopen 7097 for
this problem?
I would say: let's wait and see what upstream says (I will keep an eye
on the PARI bug).
Jeroen.
But surely if a bug is found, it
On Nov 15, 7:03 am, vgermrk wrote:
> Hi,
>
> i'm using sage in a course and we came up with some problems
> concerning the absolute value and the solve-function.
> We started to solving the equation abs(abs(x-2)-1)==4 for real x.
> But even easier equations makes problems:
>
> solve(abs(x)==5,x)
On 2010-11-15 16:48, luisfe wrote:
> About this problem. Should one open a new ticket or reopen 7097 for
> this problem?
I would say: let's wait and see what upstream says (I will keep an eye
on the PARI bug).
Jeroen.
--
To post to this group, send an email to sage-devel@googlegroups.com
To uns
On 11/15/10 03:48 PM, luisfe wrote:
About this problem. Should one open a new ticket or reopen 7097 for
this problem?
Open a new one. This is closed an apparently fixed - don't reopen it. But put a
link to the other ticket if that seem appropiate
--
A: Because it messes up the order in whi
On Nov 13, 9:45 pm, kcrisman wrote:
> That's a little orthogonal to your main question, which I should know
> the answer to, but have forgotten off hand. Might this be in sage/
> libs/ginac/ ?
Thanks for the tip, which seems to have worked. I opened a ticket
(10268), attached my patch, and uploa
> However, I'd like to be able to intelligently detect when Sage is running in
> the notebook vs. interactively on the console and only auto-create PNG files
> in notebook mode. Is there a standard technique for this?
I think the following works. Try:
sage: import sage.server.support
sage: sa
About this problem. Should one open a new ticket or reopen 7097 for
this problem?
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.go
Hi,
I've been tinkering with integrating the ROOT library from CERN into Sage. So
far things work fairly well, and I'll be learning the Sage packaging system to
make the library installable via the normal channels.
ROOT has its own plotting system which I would like to have work seamlessly
wi
On Nov 15, 3:21 pm, John Cremona wrote:
>
> According to Karim, one of these is now obsolete and should not be
> used. But I can never remember which
>
> John
According to the notes in:
http://trac.sagemath.org/sage_trac/ticket/7097
factornf uses Trager's trick and is deprecated in favo
On Mon, Nov 15, 2010 at 1:59 PM, Jeroen Demeyer wrote:
> On 2010-11-15 14:46, luisfe wrote:
>> gp: poly = t^3 + (-4*a^3 + 2*a)*t^2 - 11/3*a^2*t + 2/3*a^3 - 4/3*a
>> t^3 + (-4*a^3 + 2*a)*t^2 - 11/3*a^2*t + (2/3*a^3 - 4/3*a)
>> gp: factornf(poly, a^4 - a^2 +1)
>>
>> [t + Mod(-2*a^3 + a, a^4 - a^2 +
On 2010-11-15 14:46, luisfe wrote:
> gp: poly = t^3 + (-4*a^3 + 2*a)*t^2 - 11/3*a^2*t + 2/3*a^3 - 4/3*a
> t^3 + (-4*a^3 + 2*a)*t^2 - 11/3*a^2*t + (2/3*a^3 - 4/3*a)
> gp: factornf(poly, a^4 - a^2 +1)
>
> [t + Mod(-2*a^3 + a, a^4 - a^2 + 1) 1]
>
> [t + Mod(-4/3*a^3 + 2/3*a, a^4 - a^2 + 1) 1]
>
> [
On Nov 15, 2:38 pm, Jeroen Demeyer wrote:
> On 2010-11-15 13:53, Niels wrote:
>
> > Hi,
>
> > I think the following is a bug (only complete factorization after 2 steps):
>
> Yes, it is a bug. The problem is with the upstream package PARI/GP.
Yes, it is a bug in pari. Note also the following:
On 2010-11-15 13:53, Niels wrote:
> Hi,
>
> I think the following is a bug (only complete factorization after 2 steps):
Yes, it is a bug. The problem is with the upstream package PARI/GP.
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, sen
Package: pari
Version: 2.4.4 (development svn-12706M)
This was reported by Niels Lubbes as Sage bug on
sage-devel@googlegroups.com:
gp> t; nf = nfinit(a^4 - a^2 + 1);
gp> poly = t^3 + (-4*a^3 + 2*a)*t^2 - 11/3*a^2*t + 2/3*a^3 - 4/3*a
%1 = t^3 + (-4*a^3 + 2*a)*t^2 - 11/3*a^2*t + (2/3*a^3 - 4/3*a)
Hi,
I think the following is a bug (only complete factorization after 2 steps):
sage: R = PolynomialRing( QQ, var( 't' ), order = 'lex' )
sage: t = R.gens()[0]
sage: f = t^4 - t^2 + 1
sage: T = NumberFieldTower( [f], 'a0' )
sage: R1 = R.change_ring( T )
sage: a0 = T.gens()[0]
sage: t = R1.gens()[
This was merged in sage-4.6.1.alpha0 with an update in sage-4.6.1.alpha1
but still needs review.
See http://trac.sagemath.org/sage_trac/ticket/10156
Thanks,
Jeroen.
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-dev
On 11/13/10 11:51 PM, William Stein wrote:
Other comments:
Jason Grout:
If we're now making a convention for the global sum function (i.e., try
calling the .sum() method first), I'm curious how many other objects
have a .sum() method? Will this break things?
If you type "sum??" and read yo
Hello!
On Mon, 15 Nov 2010 03:27:48 -0800 (PST)
pang wrote:
> On 14 nov, 22:14, v...@ukr.net wrote:
> > Hello!
> > Please excuse me if I'm asking a question that has already been
> > answered somewhere. :)
> > Does this service exist for asking the questions on certain
> > specific probl
On 2010-11-15 12:10, Dr. David Kirkby wrote:
> There's a ticket to update Maxima, which also needs an update to ECL.
> (These *must* be done together) and also a library patch needs to be
> added to make the doctests pass.
>
> If anyone can test out
>
> http://trac.sagemath.org/sage_trac/ticket/1
Hi,
i'm using sage in a course and we came up with some problems
concerning the absolute value and the solve-function.
We started to solving the equation abs(abs(x-2)-1)==4 for real x.
But even easier equations makes problems:
solve(abs(x)==5,x)
Is there a reason why sage isn't able to give a us
On 2010-11-15 12:06, Dr. David Kirkby wrote:
> There are to my knowledge a few problems with making binaries with Sage
5) It is way too verbose. I have a log file of sage -bdist which is
12MB in size!
I agree with all your points, except perhaps about the compression
programs. I think the most
On 15 nov, 12:30, pang wrote:
> Hola!
> Great idea: Would you sort them into categories, or mix high school
> and advanced math?
Well, for the moment, it is just an idea. But if there is enough
consensus to make it happen, i would vote for having several
categories: high school, undergrad, gradua
Hola!
Great idea: Would you sort them into categories, or mix high school
and advanced math?
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http:
On 14 nov, 22:14, v...@ukr.net wrote:
> Hello!
> Please excuse me if I'm asking a question that has already been
> answered somewhere. :)
> Does this service exist for asking the questions on certain
> specific problems and algorithms or for some kind of generic questions?
Why don't you ask
There's a ticket to update Maxima, which also needs an update to ECL. (These
*must* be done together) and also a library patch needs to be added to make the
doctests pass.
If anyone can test out
http://trac.sagemath.org/sage_trac/ticket/10187
it would be good to know of any problems.
It's be
There are to my knowledge a few problems with making binaries with Sage
1) It is slow
2) It fails to work on Solaris, unless on installs the GNU binutils and uses a
GNU version of 'cp'
3) A minor point, but this bit of code
TARGET=`echo $TARGET | sed -e 's/ //'` #no blank spaces
will on
On 11/15/10 05:59 AM, rjf wrote:
On Nov 14, 11:45 am, "Dr. David Kirkby"
wrote:
I asked RJF what languge he thought the interface should be. As 10 options I
consider might be viable choises where
Whether there should be a single language for implementation
and user interface for a compute
47 matches
Mail list logo
