I think this should work (i.e., Integer __pow__ should be written so
that it does the pythonic thing of giving up so that python can try the
other argument's __rpow__ method). Is the fix easy?
class A:
def __rpow__(self, base):
print self
print base
return base
Dirk wrote:
>
> By the way, the numerical answers you got are very bad, but Maxima is
> not a numerical analysis package. The way to get good numerical roots
> is:
> sage: pari('x^5+x^3+17*[x + (0.0588115223184494 + 0.E-38*I), 1; x +
> (-1.36050567903502 +
> 1.51880872209965*I), 1; x + (1.33109
On Sep 15, 9:27 pm, kcrisman wrote:
> We have some inconsistency in solve.
>
> sage: solve(x^5+x^3+17*x+1,x)
>
> [x == -0.0588115172555,
> x == (-1.33109991788 + 1.52241655184*I),
> x == (-1.33109991788 - 1.52241655184*I),
> x == (1.36050567904 + 1.5188087221*I),
> x == (1.36050567904 - 1.51
On Wed, Sep 16, 2009 at 10:52 AM, Jason Grout
wrote:
> I think networkx 0.99 will require some nontrivial work in Sage, since
> they changed a lot of things.
NetworkX 1.0 should be out soon under the BSD license. Previous
versions were under LGPL.
--
Regards
Minh Van Nguyen
--~--~-
On Sep 15, 5:46 pm, "Dr. David Kirkby"
wrote:
> The file sage-README-osx.txt is very confusing. If someone downloads the
> source, the readme file indicates they have downloaded binaries.
>
> There should perhaps be two README files - one for source, and one for
> binaries.
>
> I'm not sure the
I hope this isn't old news. I just figured out how to use "lambda" as
a variable without conflicting with the Python keyword. It's very
simple -- all you need to do is put an underscore at the end of the
name:
lambda_ = var("lambda")
This is the syntax for adding a subscript, but ... no subscrip
Paulo César Pereira de Andrade wrote:
> 2009/9/15 Jason Grout :
>
>>> sage -t "devel/sage/sage/matrix/constructor.py"
>>> **
>>> File "/usr/share/sage/devel/sage/sage/matrix/constructor.py", line 155:
>>> sage: g = graphs.Pe
2009/9/15 Jason Grout :
>> sage -t "devel/sage/sage/matrix/constructor.py"
>> **
>> File "/usr/share/sage/devel/sage/sage/matrix/constructor.py", line 155:
>> sage: g = graphs.PetersenGraph()
>> Expected nothing
>> Got:
>>
Hi folks,
On Wed, Sep 16, 2009 at 6:46 AM, Jason Grout
wrote:
> William has asked me to announce a Review Day next Tuesday, 22
> September. The goal is take care of every ticket that has "needs
> review" status and either declare it positive review or give specific
> feedback and put it in t
Jason Moxham wrote:
> On Tuesday 15 September 2009 18:37:08 Dr. David Kirkby wrote:
>> There is another issue which must be considered when building binaries.
>> Building them on version 'n' of an operating system does not guaranatee
>> they will work on 'n-1'. On Solaris, building on a late rele
The file sage-README-osx.txt is very confusing. If someone downloads the
source, the readme file indicates they have downloaded binaries.
There should perhaps be two README files - one for source, and one for
binaries.
I'm not sure the best way to handle this. I think it probably needs an
OS
We have been extremely blessed lately with a load of great
contributions. Currently, there are:
* 96 tickets that have patches/spkgs and are waiting for review:
http://trac.sagemath.org/sage_trac/report/10. These tickets have been
waiting for review for up to 10 months! [1]
* 6 tickets
I thought you might be interested in this:
http://www.ai.sri.com/~stickel/snark.html
Regards,
Hazem
--~--~-~--~~~---~--~~
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..
It's been noticed and the 2 recent spammers banned. It seems some spammers
are able to beat the system, or else google's filters are not working properly.
Sorry for the spam and inconvenience.
On Tue, Sep 15, 2009 at 3:47 PM, Martin Albrecht
wrote:
>
> Just in case the moderators all have spam
Just in case the moderators all have spam filters which filter this stuff: We
have SPAM on [sage-devel].
Martin
On Tuesday 15 September 2009, nag wrote:
> LEARN TO EARN, EARN TO LEARN!
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5
I believe that mpz size is the right number of limbs for a FLINT fmpz.
Bill.
2009/9/15 Robert Bradshaw :
> On Sep 14, 2009, at 3:47 PM, Sebastian Pancratz wrote:
>
>> Dear all,
>>
>> The implementation of QQ[] using FLINT is making lots of progress and
>> it seems as if everything should be *muc
Dear sage-devel,
We have some inconsistency in solve.
sage: solve(x^5+x^3+17*x+1,x)
[x == -0.0588115172555,
x == (-1.33109991788 + 1.52241655184*I),
x == (-1.33109991788 - 1.52241655184*I),
x == (1.36050567904 + 1.5188087221*I),
x == (1.36050567904 - 1.5188087221*I)]
sage: from sage.symbol
Paulo César Pereira de Andrade wrote:
> 2009/9/15 kcrisman :
As for you for now, you'd need to change the eigenvectors() command in
the matrix code. If you wanted to do so and submit a patch, it would be
greatly appreciated!
>> But all doctests pass for me in alpha1:
>>
>> ./sage -
2009/9/15 kcrisman :
>
>> > As for you for now, you'd need to change the eigenvectors() command in
>> > the matrix code. If you wanted to do so and submit a patch, it would be
>> > greatly appreciated!
>>
>
> But all doctests pass for me in alpha1:
>
> ./sage -t "devel/sage/sage/matrix/"
> All te
http://wiki.sagemath.org/days17/status
--
William Stein
Associate Professor of Mathematics
University of Washington
http://wstein.org
--~--~-~--~~~---~--~~
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an
On Sep 14, 2009, at 3:47 PM, Sebastian Pancratz wrote:
> Dear all,
>
> The implementation of QQ[] using FLINT is making lots of progress and
> it seems as if everything should be *much* faster than it is now.
>
> At the moment, I've got two questions. First one is about the design
> of the gcd m
On Tue, Sep 15, 2009 at 11:14 AM, Jason Grout
wrote:
>
> I just worked on implementing the sage-combinat generic testing
> framework for matrices, with a test function for minpoly. I got some
> interesting results. Is there something wrong in these tests below?
>
> *
Jason Grout wrote:
> I just worked on implementing the sage-combinat generic testing
> framework for matrices, with a test function for minpoly. I got some
> interesting results. Is there something wrong in these tests below?
>
My patch that exposes these as doctest failures (as well as one
On Tuesday 15 September 2009 18:37:08 Dr. David Kirkby wrote:
> Jason Moxham wrote:
> > Thanks , but I mean the machine on which the original binarys were
> > compiled on , I assume it was some box on skynet? If my fix is correct
> > then gcc on that particular machine has been compiled with the d
I just worked on implementing the sage-combinat generic testing
framework for matrices, with a test function for minpoly. I got some
interesting results. Is there something wrong in these tests below?
**
Over GF(5), I ge
Jason Moxham wrote:
> Thanks , but I mean the machine on which the original binarys were compiled
> on , I assume it was some box on skynet? If my fix is correct then gcc on
> that particular machine has been compiled with the default cpu set too high.
I can't say for Linux, but I'm not aware
Minh Nguyen wrote:
> Hi folks,
>
> When reviewing or updating packages on t2.math, I source the compiler
> as GCC 4.4.1 with the Sun linker by putting the following line in my
> ".profile":
>
> source /usr/local/gcc-4.4.1-sun-linker/gcc441sun # Sun linker/asembler
>
> But if I'm porting package
On Sep 15, 5:48 pm, David Roe wrote:
> I agree that the results are inconsistent, but it is true that 0*d = 1 (mod
> 1).
Aha. That statement does not mean (0*d)%1 == 1. It means $ 0\times d
\equiv_1 1.$
Maybe the examples 1.inverse_mod(0) and 0.inverse_mod(1) could be
added to the docstring
Ryan Hinton wrote:
>
> I am trying to convert a multivariate polynomial to the symbolic ring
> for manipulation. In particular, subs() for the polynomial was *really*
> slow. I think the following should work.
>
> R. = QQ[]
> eq = a^2 + 2*b
> sreq = SR(eq)
> sra, srb = sreq.variables()
> sre
I am trying to convert a multivariate polynomial to the symbolic ring
for manipulation. In particular, subs() for the polynomial was *really*
slow. I think the following should work.
R. = QQ[]
eq = a^2 + 2*b
sreq = SR(eq)
sra, srb = sreq.variables()
sreq.subs(sra=3)
# should return 9 + 2*b,
On Tuesday 15 September 2009 16:10:51 pang wrote:
> > Which machine is the live dvd built on?
> >
> > Jason
>
> I'm not sure I understand: I used SAGE binaries. I can test the live
> dvd in several machines. We've tried several already, with the result
> that the binaries did not work in Pentium I
Hi Jason,
On Wed, Sep 16, 2009 at 1:51 AM, Jason Grout
wrote:
>
>
> What is the status of the generic testing that Nicolas mentions here?
>
> http://groups.google.com/group/sage-devel/browse_frm/thread/b43c9eaccea1da/ecb578c1dcd25ab6?hl=en&ie=UTF-8&oe=utf-8&q=generic+doctesting+group:sage-devel#
What is the status of the generic testing that Nicolas mentions here?
http://groups.google.com/group/sage-devel/browse_frm/thread/b43c9eaccea1da/ecb578c1dcd25ab6?hl=en&ie=UTF-8&oe=utf-8&q=generic+doctesting+group:sage-devel#ecb578c1dcd25ab6
Karl-Dieter just realized that symbolic matrices have
I agree that the results are inconsistent, but it is true that 0*d = 1 (mod
1). And as a number theorist, I like the current behavior better than your
proposed solution, which would translate x into the interval [0,d).
I would suggest changing 4705 of integer.pyx to:
if mpz_cmp_ui(m.value, 1)
> Which machine is the live dvd built on?
>
> Jason
I'm not sure I understand: I used SAGE binaries. I can test the live
dvd in several machines. We've tried several already, with the result
that the binaries did not work in Pentium III or IV, and work in Core
(T2000 I think) or newer, including
LEARN TO EARN, EARN TO LEARN!
100% Free – Click – Register - Earn 2000/day - TRUE
IT IS FREE TO REGISTER,
REGISTER AND START EARNINGGG
http://www.IndiaStudyChannel.com?ref=naghu0452
http://xcel-onlinesurveys.com?sid=1&rid=AF117356&aid=0
http://www.frenszone.com/?idAff=62554
http://www.adsu
sell af1 jordan shoes , air force one shoes - $36
we supply kinds of brand shoes such as Nike shoe Air Jordan series,
nike Air force One( AF1),af1 25th anniversary shoes, Dunk sb,nike Air
Max 95/97/2003/2004/05/06/TN/360,air max lmt,90/up; Nike Shox TL/TL2/
TL3/NZ/r2/R4//r3/r5/turbo. Also as Adid
kcrisman wrote:
>
>> For some reason SR eigenvectors were never actually tested, I think -
>> because they inherit directly from matrix2.pyx! In fact, the error
>> comes from eigenspaces_left in that file, where G = self.fcp() calls
>> degree of a symbolic expression, which now requires an argum
LEARN TO EARN, EARN TO LEARN!
100% Free – Click – Register - Earn 2000/day - TRUE
IT IS FREE TO REGISTER,
REGISTER AND START EARNINGGG
http://www.IndiaStudyChannel.com?ref=naghu0452
http://xcel-onlinesurveys.com?sid=1&rid=AF117356&aid=0
http://www.frenszone.com/?idAff=62554
http://www.adsu
On Tue, Sep 15, 2009 at 9:20 PM, Dr. David Kirkby
wrote:
>
> I've created a new .spkg from a CVS snapshot.
>
> http://sage.math.washington.edu/home/kirkby/Solaris-fixes/ecl-9.8.4-cvs-13th-Sept-2009-3rd-try/ecl-9.8.4-cvs-13th-Sept-2009.spkg
Here is David Kirkby's updated ECL package with all cha
On Tuesday 15 September 2009 10:00:34 William Stein wrote:
> On Tue, Sep 15, 2009 at 1:36 AM, Pablo Angulo wrote:
> > Hello:
> > On a Pentium IV machine, two versions of sage 4.1 yield approximately
> > the same error (the following is cut and paste when trying the second):
> >
> > /opt/sage-4.
sage: 3%(-1)
0
sage: Rational(3)%Rational(-1)
---
ZeroDivisionError Traceback (most recent call
last)
/usr/local/src/sage-4.1.1/local/lib/python2.6/site-packages/sage/rings/
rational.so in sage.r
That's great news! Thanks a lot for your work on testing and
integrating ECL and sorry for all the annoyances that these problems
may have caused you.
Juanjo
On Sep 15, 1:20 pm, "Dr. David Kirkby"
wrote:
> I've created a new .spkg from a CVS snapshot.
>
> http://sage.math.washington.edu/home/ki
Hi folks,
When reviewing or updating packages on t2.math, I source the compiler
as GCC 4.4.1 with the Sun linker by putting the following line in my
".profile":
source /usr/local/gcc-4.4.1-sun-linker/gcc441sun # Sun linker/asembler
But if I'm porting packages to Solaris, is there an equivalent
> For some reason SR eigenvectors were never actually tested, I think -
> because they inherit directly from matrix2.pyx! In fact, the error
> comes from eigenspaces_left in that file, where G = self.fcp() calls
> degree of a symbolic expression, which now requires an argument ! The
> symbolic u
Also see http://trac.sagemath.org/sage_trac/ticket/6165.
On Sep 15, 9:28 am, kcrisman wrote:
> > > As for you for now, you'd need to change the eigenvectors() command in
> > > the matrix code. If you wanted to do so and submit a patch, it would be
> > > greatly appreciated!
>
> But all doctests
> > As for you for now, you'd need to change the eigenvectors() command in
> > the matrix code. If you wanted to do so and submit a patch, it would be
> > greatly appreciated!
>
But all doctests pass for me in alpha1:
./sage -t "devel/sage/sage/matrix/"
All tests passed!
Total time for all test
I've created a new .spkg from a CVS snapshot.
http://sage.math.washington.edu/home/kirkby/Solaris-fixes/ecl-9.8.4-cvs-13th-Sept-2009-3rd-try/ecl-9.8.4-cvs-13th-Sept-2009.spkg
I've tested this on:
* 32-bit OS X (bsd.math)
* 64-bit OS X (bsd.math)
* 32-bit Solaris (Sun of mine)
Hi, I found this example of using Sage in education. Especially the
notebook primer might be worth looking into.
Course:
http://www.math.canterbury.ac.nz/STAT218/09/S2/C/
Notebook Primer:
http://www.math.canterbury.ac.nz/~r.sainudiin/courses/STAT218/2009/PreSage/SageSignInAndUsing.pdf
Notebook:
h
Sorry for the late report but sage finally compiles and runs on ubuntu karmic.
sage -testall passes except for
sage -t "devel/sage/sage/server/simple/twist.py"
However, re-runnig this test, I got an "All tests passed!", so
it looks like there are no problems now with ubuntu 9.10.
On Mon, Sep 7,
>
> http://wiki.sagemath.org/faq#Otherquestions
>
> William
Thanks!
Well, this raises issues for a live dvd that should work on as most
computers as possible. I'll give some thought to find the best
solution.
--~--~-~--~~~---~--~~
To post to this group, send an em
On Tue, Sep 15, 2009 at 1:36 AM, Pablo Angulo wrote:
>
> Hello:
> On a Pentium IV machine, two versions of sage 4.1 yield approximately
> the same error (the following is cut and paste when trying the second):
>
> /opt/sage-4.1.1-linux-Ubuntu_9.04-i686-Linux/local/bin/sage-sage: line
> 199: 527
The version of lcalc in Sage sage-4.1.2.alpha1 will not build on Solaris
if the Sun assembler is used, as the lcalc author chose to add the
compiler option
-Wa,-W
which was intended to suppress warnings from the assembler.
Note, -Wa,-foobar passes -foobar directly to the assembler/
Since -W
Hello:
On a Pentium IV machine, two versions of sage 4.1 yield approximately
the same error (the following is cut and paste when trying the second):
/opt/sage-4.1.1-linux-Ubuntu_9.04-i686-Linux/local/bin/sage-sage: line
199: 5276 Instrucción ilegal (core dumped) sage-ipython "$@" -i
First ver
Jason Grout wrote:
> Paulo César Pereira de Andrade wrote:
>> Do you have any idea as to what would be the proper way to correct
>> this issue? Preferably without needing to use an older maxima for the
>> sage package :-)
>
> This change was actually motived by a request from the Sage project
55 matches
Mail list logo