I know this is coming up soon but thought some of you working
on dsage might be interested in this.
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more option
this is one of the strangest bugs i've seen. using sage 2.3, sometimes
constructing quotients in the rational function field CC(z) freezes, and
sometimes not. when i say freezes, i mean it justs sits there until i
press ctrl-C. no error, no stack overflow... just sits and runs forever.
once i
perhaps there's been a discussion about this that i didn't pay attention
to, but i just realized that equality (==) is not always transitive:
In [109]: mod(2,5)==mod(2,10)
Out[109]: True
In [110]: mod(2,5)==mod(7,10)
Out[110]: True
In [111]: mod(2,10)==mod(7,10)
Out[111]: False
what is the r
oops, instead of
> FractionFieldElement(z.parent(),(I-z),(z+1.8),reduce=false)
i should have written
>
> FractionFieldElement(z.parent().fraction_field(),(I-z),(z+1.8),reduce=false)
because that works.
-kyle
--~--~-~--~~~---~--~~
To post to this gro
On 4/4/07, Kyle Schalm <[EMAIL PROTECTED]> wrote:
> perhaps there's been a discussion about this that i didn't pay attention
> to, but i just realized that equality (==) is not always transitive:
>
> In [109]: mod(2,5)==mod(2,10)
> Out[109]: True
>
> In [110]: mod(2,5)==mod(7,10)
> Out[110]: True
>
> I'm not sure what to say except:
> (1) the definition of equality in SAGE is "equal images under a
> canonical map",
hmmm. ok. if i wanted to find out the semantics of some SAGE operator,
where would i look? perusing the reference manual, i didn't see any
discussion of this. perhaps ther
On 4/4/07, Kyle Schalm <[EMAIL PROTECTED]> wrote:
> > I'm not sure what to say except:
> > (1) the definition of equality in SAGE is "equal images under a
> > canonical map",
>
> hmmm. ok. if i wanted to find out the semantics of some SAGE operator,
> where would i look? perusing the reference ma
What do you think of the attached? The problem was that
gcd of numerical polynomials, via the algorithm we use, doesn't
always converge, so polynomials couldn't be reduced to lowest
terms. The patch changes the behavior of SAGE so fraction fields
over non-exact rings do not divide the numerator a
