[sage-devel] Re: switching to A.parent() is not B.parent()

2006-10-17 Thread David Joyner
On 10/16/06, David Harvey [EMAIL PROTECTED] wrote: I started examining what breaks if we change the condition A.parent () != B.parent() in e.g. RingElement.__add__ to the condition A._parent is not B._parent. There are a bunch of broken things. The following examples are all on a mongrel

[sage-devel] Re: Debian packages

2006-10-17 Thread William Stein
On Tue, 17 Oct 2006 03:22:55 -0700, Pere Urbón Bayes [EMAIL PROTECTED] wrote: Hello to every body, I was trying to package sage for debian but first I must ask if any one into the community is doing it? Yes, this been a topic of discussion recently. Here's an email from somebody else

[sage-devel] Re: Fwd: Re: Sage Notebook CD

2006-10-17 Thread William Stein
On Tue, 17 Oct 2006 07:46:14 -0700, David Joyner [EMAIL PROTECTED] wrote: I think it would be helpful if the README file contained more details on the exact setup required to get this to work. I tried burning the iso to a CD and rebooting. my suse 10.1 PC but could not see how to get sage

[sage-devel] Re: Fwd: Re: Sage Notebook CD

2006-10-17 Thread Alfredo Portes
Thank you Bill. I will also wonder if anybody burned the Live CD (not in the virtual machine) and if it worked properly I untarred the tar.gz file and burned just the iso image to a CD. I booted the CD on a 2nd workstation attached to the same local network as my desktop workstation.

[sage-devel] Re: switching to A.parent() is not B.parent()

2006-10-17 Thread Bill Hart
David Harvey wrote: BTW something I don't like about O() is that e.g. O(5^100) has to compute 5^100, and then work out that it's a power of 5! And worse, it does it by actually calling factor()! If you know something is a power of p (or that it *should* be a power of p), there are faster

[sage-devel] Re: switching to A.parent() is not B.parent()

2006-10-17 Thread David Harvey
On Oct 17, 2006, at 2:18 PM, Bill Hart wrote: The following is completely just for fun, and not meant to be taken seriously: Understood. Just to make sure the above was accurate, I computed the factors of p^100 for random primes p below 16. It was only 10% slower, i.e. it could compute

[sage-devel] Re: NTL replacement and new Quadratic Sieve

2006-10-17 Thread David Harvey
On Oct 17, 2006, at 6:40 PM, Bill Hart wrote: I will try implementing some polynomial multiplication routines over the next week and see just how bad NTL's routines are. I don't expect to beat NTL straight away, since there are so many possible algorithms to use, and so many variants, that

[sage-devel] Re: NTL replacement and new Quadratic Sieve

2006-10-17 Thread Bill Hart
David Harvey wrote: Let me know if you come up with anything, I would be extremely interested. The goal of course is to beat both NTL and MAGMA :-) Naturally! We aren't playing little league. :-) Actually, I have just had a thorough look at NTL, and I see numerous possible problems. What