> Too bad. But it should still be reported and fixed. malb: any opinion
> here?
sage: P.=IntegerModRing(5)[]
sage: f=x*(y^2-x)^2+y^5;
sage: g=y^4+y^3-x^2
sage: f.resultant(g)
---
TypeError Trac
On Jan 7, 1:34 am, Martin Rubey wrote:
> mabshoff writes:
> > Is this what you want?
Hi,
> Actually, I want:
>
> (15) -> f := x*(y^2-x)^2+y^5; g := y^4+y^3-x^2
>
> 4 3 2
> (15) y + y - x
> Type: Polynomial(Integer)
> (
mabshoff writes:
> Is this what you want?
Actually, I want:
(15) -> f := x*(y^2-x)^2+y^5; g := y^4+y^3-x^2
432
(15) y + y - x
Type: Polynomial(Integer)
(16) -> factor resultant(f,g,x)
92
(16) y
On Jan 7, 1:08 am, Martin Rubey wrote:
> What did I do wrong? I have no idea how to proceed!
Hi Martin,
> Martin
>
> sage: f=Integers(5)[y][x](x*(y^2-x)^2+y^5); g=Integers(5)[y][x](y^4+y^3-x^2);
> sage: f
> x^3 + 3*y^2*x^2 + y^4*x + y^5
> sage: f.res
> f.reset_name f.resultant
> sage: f.r
On Feb 3, 2007, at 12:14 PM, Joel B. Mohler wrote:
> Here's an annoying bug in an edge case. It appears that PARI (the
> QQ case
> below) computes the resultant correctly for a constant polynomial
> with itself
> and NTL (the ZZ case below) computes it incorrectly. I'm not
> really sure
