Do not build sage as root. We should have something in place now where
the build process will tell you do that from the beginning if you try.
François
> On 24/01/2015, at 11:08, 손정갑 wrote:
>
>
> What should I do for install sage in my computer?
>
>
>
> --
> You received this message becaus
On Fri, 23 Jan 2015 16:44:16 +0100
Vincent Delecroix <20100.delecr...@gmail.com> wrote:
> I found out that we have problems with elements of ZZ(x):
>
> sage: x = polygen(ZZ)
> sage: p = (-1)/(-x)
> sage: q = 1/x
> sage: p
> -1/-x
> sage: q
> 1/x
> sage: p == q
> True
> sage: hash(p) == hash(q)
>
What should I do for install sage in my computer?
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To post to this group,
Hi Djordjo,
It turns out that in your example the decomposition group is represented
internally as a permutation group on the wrong number of elements. I am
now testing a fix; see http://trac.sagemath.org/ticket/17664 .
Peter
> -- Forwarded message --
> From: Djordjo Milovic
>
Hi Djordjo,
It turns out that in your example the decomposition group is represented
internally as a permutation group on the wrong number of elements. I am
now testing a fix; see http://trac.sagemath.org/ticket/17664 .
Peter
> -- Forwarded message --
> From: Djordjo Milovic
>
I have forwarded your question to sage-nt
John Cremona
On 23 January 2015 at 12:51, Djordjo Milovic wrote:
> Hi all,
>
> Can someone explain why there is an error when I try to compute an Artin
> symbol which is supposed to be trivial? In the following example, I am
> computing Artin symbols of
Hello,
I found out that we have problems with elements of ZZ(x):
sage: x = polygen(ZZ)
sage: p = (-1)/(-x)
sage: q = 1/x
sage: p
-1/-x
sage: q
1/x
sage: p == q
True
sage: hash(p) == hash(q)
False
One good challenge for the bug days. If no ticket is yet open about
it, I will do that shortly.
Vin
Marc Mezzarobba wrote:
> sage.structure.sequence provides something similar for lists (and is
> indeed very useful), but I don't think it has a counterpart for
> dictionaries.
Oops, I read too fast: of course, the behaviour of sequences is
analogous to coercing the *values* to a common parent, no
On Fri, Jan 23, 2015 at 7:58 AM, mmarco wrote:
> So, today is Sage's 10'th birthday?
>
> Happy birthday!
Happy birthday, Sage!
>
> El martes, 20 de enero de 2015, 20:48:09 (UTC+1), William escribió:
>>
>> Hi,
>>
>> If you look at http://wstein.org/sage_old/ you'll find the first few
>> tarballs
martin.vgag...@gmx.net wrote:
> Is there anything like this around already?
sage.structure.sequence provides something similar for lists (and is
indeed very useful), but I don't think it has a counterpart for
dictionaries.
--
Marc
--
You received this message because you are subscribed to th
So, today is Sage's 10'th birthday?
Happy birthday!
El martes, 20 de enero de 2015, 20:48:09 (UTC+1), William escribió:
>
> Hi,
>
> If you look at http://wstein.org/sage_old/ you'll find the first few
> tarballs of Sage I ever released. The first one [1] has a README that
> starts:
>
> -
Hi all,
Can someone explain why there is an error when I try to compute an Artin
symbol which is supposed to be trivial? In the following example, I am
computing Artin symbols of some odd primes in the quadratic extension of
discriminant -4. The Artin symbols of primes $\equiv 3\bmod 4$ are com
Hi!
There are several places in sage where some operation returns a dictionary,
and the values of the dictionary all come from a single category. In some
places, that category is less than obvious. Example:
sage: R. = PolynomialRing(QQ, order='lex')
sage: I = R.ideal(c^2-2, b-c, a)
sage: v = I.
13 matches
Mail list logo
