On Mon, 15 Jan 2007 21:08:02 -0800, Nick Alexander <[EMAIL PROTECTED]> wrote:
And another.
sage: R. = ZZ['x']
sage: x^3 % 2
DivRem: quotient undefined over ZZ
/Users/nalexand/Devel/sage/local/bin/sage-sage: line 174: 13174 Abort
trap sage-ipython -c "$SAGE_STARTUP_COMMAND;" "$@"
And another.
sage: R. = ZZ['x']
sage: x^3 % 2
DivRem: quotient undefined over ZZ
/Users/nalexand/Devel/sage/local/bin/sage-sage: line 174: 13174 Abort
trap sage-ipython -c "$SAGE_STARTUP_COMMAND;" "$@"
Yikes!
Nick
--~--~-~--~~~---~--~~
To post to t
Hi everyone, esp. William and Ifti,
I had been looking at the reference documentation building code, but I
haven't made too much progress and I don't have time to continue. So
Ifti, please don't wait any more :)
Sorry,
Nick
--~--~-~--~~~---~--~~
To post to thi
Short Changelog:
Fixed interactive spkg-install
Added DistributedPOVRay (requires you to have povray and the program
'combineppm' installed)
spkg here: http://sage.math.washington.edu/home/yi/spkgs/
dsage-0.0.2.spkg
Yi
--~--~-~--~~~---~--~~
To post to th
On Mon, 15 Jan 2007 20:03:30 -0800, Nick Alexander <[EMAIL PROTECTED]> wrote:
sage/modules/complex_double_vector.pyx -->
/Users/nalexand/Devel/sage/local//lib/python/site-packages//sage/modules/complex_double_vector.pyx
pyrexc --embed-positions
-I/Users/nalexand/Devel/sage-alpha8/devel/sage-nc
sage/modules/complex_double_vector.pyx -->
/Users/nalexand/Devel/sage/local//lib/python/site-packages//sage/modules/complex_double_vector.pyx
pyrexc --embed-positions
-I/Users/nalexand/Devel/sage-alpha8/devel/sage-nca
sage/modules/complex_double_vector.pyx
Error converting Pyrex file to C:
-
On Mon, 15 Jan 2007, Justin C. Walker wrote:
I see this behavior, but it seems to be changed (both for ipython and
sage) from earlier behavior. Specifically, when you 'uparrow', you
get the full, multi-line, input displayed. as if it were one line.
Once was both systems would display each 'part
On 1/15/07, Justin C. Walker <[EMAIL PROTECTED]> wrote:
To add to the confusion:
I see this behavior, but it seems to be changed (both for ipython and
sage) from earlier behavior. Specifically, when you 'uparrow', you
get the full, multi-line, input displayed. as if it were one line.
Once w
To add to the confusion:
On Jan 15, 2007, at 14:41 , Fernando Perez wrote:
On 1/15/07, William Stein <[EMAIL PROTECTED]> wrote:
[snip]
I just had a look at:
http://sage.math.washington.edu:9002/sage_trac/ticket/130
and I can't see that behavior in a normal, current, non-sage ipython:
In [1
On 1/15/07, William Stein <[EMAIL PROTECTED]> wrote:
> I just had a look at:
>
> http://sage.math.washington.edu:9002/sage_trac/ticket/130
>
> and I can't see that behavior in a normal, current, non-sage ipython:
That's correct. It's entirely a SAGE/IPython integration problem. The
problem d
On Mon, 15 Jan 2007 14:41:05 -0800, Fernando Perez <[EMAIL PROTECTED]> wrote:
On 1/15/07, William Stein <[EMAIL PROTECTED]> wrote:
Hello,
I've made a list of all known serious fixable interesting bugs
in SAGE-1.6.1 here:
http://sage.math.washington.edu:9002/sage_trac/milestone/sage-1.8
On 1/15/07, William Stein <[EMAIL PROTECTED]> wrote:
Hello,
I've made a list of all known serious fixable interesting bugs
in SAGE-1.6.1 here:
http://sage.math.washington.edu:9002/sage_trac/milestone/sage-1.8
These are bugs that are not frivolous, and in most cases have some mathematica
Hello,
I've made a list of all known serious fixable interesting bugs
in SAGE-1.6.1 here:
http://sage.math.washington.edu:9002/sage_trac/milestone/sage-1.8
These are bugs that are not frivolous, and in most cases have some mathematical
content. The goal is to fix them all before sage-2.0
On Mon, 15 Jan 2007 06:46:56 -0800, Jaap Spies <[EMAIL PROTECTED]> wrote:
Updating to 1.6.1 under Cygwin:
gcc -DMONOLITH -I.. -I../include -D_WINDLL -DOPENSSL_PIC
-DOPENSSL_THREADS -DDSO_DLFCN -DHAVE_DLFCN_H -DTERMIOS -DL_ENDIAN
-fomit-frame-pointer -O3 -march=i486 -Wall -DOPENSSL_BN_ASM_PAR
On Jan 15, 2007, at 8:26 AM, William Stein wrote:
On Mon, 15 Jan 2007 04:35:33 -0800, David Joyner
<[EMAIL PROTECTED]> wrote:
On 1/15/07, David Kohel <[EMAIL PROTECTED]> wrote:
For x, m != 0 in a Euclidean domain, one should have:
x == m*(x.div(m)) + x.mod(m)
Although one can get t
On Mon, 15 Jan 2007 04:35:33 -0800, David Joyner <[EMAIL PROTECTED]> wrote:
On 1/15/07, David Kohel <[EMAIL PROTECTED]> wrote:
For x, m != 0 in a Euclidean domain, one should have:
x == m*(x.div(m)) + x.mod(m)
Although one can get the result of x.div(m) as x.quo_rem(m)[0],
but I would
On Mon, 15 Jan 2007 05:16:33 -0800, David Harvey <[EMAIL PROTECTED]> wrote:
On Jan 15, 2007, at 8:09 AM, David Kohel wrote:
Any ideas how to get a random number from 1 to n in SAGE?
Here's a bad way to do it:
sage: n = 10^2
sage: G = SymmetricGroup(n)
sage: G.random()(1)
which will blow up
On Mon, 15 Jan 2007 05:09:42 -0800, David Kohel <[EMAIL PROTECTED]> wrote:
Any ideas how to get a random number from 1 to n in SAGE?
Here's a bad way to do it:
sage: n = 10^2
sage: G = SymmetricGroup(n)
sage: G.random()(1)
which will blow up as n goes to infinity.
Here's a slightly better
David Joyner wrote:
I'm not but I think gmail is very smart about auto-deleting
duplicates, so I suspect everyone but gmail users may have
the same problem as you.
I'll look into it and see if the fault is with googlegroups.
Thanks for reporting it.
+++
On
Updating to 1.6.1 under Cygwin:
gcc -DMONOLITH -I.. -I../include -D_WINDLL -DOPENSSL_PIC
-DOPENSSL_THREADS -DDSO_DLFCN -DHAVE_DLFCN_H -DTERMIOS -DL_ENDIAN
-fomit-frame-pointer -O3 -march=i486 -Wall -DOPENSSL_BN_ASM_PART_WORDS
-DOPENSSL_IA32_SSE2 -DSHA1_ASM -DMD5_ASM -DRMD160_ASM -DAES_ASM -c
Either randint(a,b) or randrange(a,b) do what you want I think.
On 1/15/07, David Kohel <[EMAIL PROTECTED]> wrote:
Any ideas how to get a random number from 1 to n in SAGE?
Here's a bad way to do it:
sage: n = 10^2
sage: G = SymmetricGroup(n)
sage: G.random()(1)
which will blow up as n goe
On Jan 15, 2007, at 8:09 AM, David Kohel wrote:
Any ideas how to get a random number from 1 to n in SAGE?
Here's a bad way to do it:
sage: n = 10^2
sage: G = SymmetricGroup(n)
sage: G.random()(1)
which will blow up as n goes to infinity.
Here's a slightly better one:
sage: x = random()
sa
Any ideas how to get a random number from 1 to n in SAGE?
Here's a bad way to do it:
sage: n = 10^2
sage: G = SymmetricGroup(n)
sage: G.random()(1)
which will blow up as n goes to infinity.
Here's a slightly better one:
sage: x = random()
sage: int(n*x)
At least it gives a float's worth of
On 1/15/07, David Kohel <[EMAIL PROTECTED]> wrote:
For x, m != 0 in a Euclidean domain, one should have:
x == m*(x.div(m)) + x.mod(m)
Although one can get the result of x.div(m) as x.quo_rem(m)[0],
but I would suggest having this as a separate function.
Seconded.
I know that it is mo
For x, m != 0 in a Euclidean domain, one should have:
x == m*(x.div(m)) + x.mod(m)
Although one can get the result of x.div(m) as x.quo_rem(m)[0],
but I would suggest having this as a separate function.
I know that it is more efficient, if one wants both, to use quo_rem,
and
essentially no
William Stein wrote:
Hi,
This might be an excellent project for somebody:
http://sage.math.washington.edu:9002/sage_trac/ticket/191
Basically, it's to create a huge table of known classes
of integers and their factorizations for SAGE, which would
be automatically consulted by the factor comm
Here's a similar error. I haven't tried with that patch, but my
spidey-sense suggests a different issue:
sage: R. = Integers(5**2)['x']
sage: S. = R.quo(x^5 - x + 1)
sage: (5*xbar + 1).lift() % 5
ZZ_p: division by non-invertible element
/Users/nalexand/Devel/sage/local/bin/sage-sage: line 174:
27 matches
Mail list logo
