John,
> I can easily factor mod two primes around 10^7 and then use CRT,
> though that is a bit of a pain. So my question is: what's this limit
> on the size of primes p for which factorization over GF(p)[X,Y] is
> possible, where does this limit come from, and is it documented?
the limi
Hi,
I am a newbie working in polynomial quotient rings:
I want to implement the Patterson algorithm to decode Goppa Codes.
Therefore, I need to split a polynomial p in a quotient ring in its
even part p0 and its odd part p1
such that p(z) = p0^2(z)+z*p1^2(z). I run into several problems to do
so in
I have a polynomial f in ZZ[X,Y] which I want to factor. (Typical
example has degree 84 in X, degree 336 in Y and factors into degrees
(6,24)+(78,312).)
f.factor() does not work: NotImplementedError: Factorization of
multivariate polynomials over non-fields is not implemented.
Changing ring to Q
I found this method in polynomial_element.pyx file
thanks
2011/9/30 Juan Grados
> Hi David,
>
> Yes already, but I want build other new, because I need make modification
> in EEA (add other stop parade), but I first that my "EEA Algorithm" work
> fine ...
>
> thanks
>
>
> 2011/9/30 David Joyn
Hi David,
Yes already, but I want build other new, because I need make modification
in EEA (add other stop parade), but I first that my "EEA Algorithm" work
fine ...
thanks
2011/9/30 David Joyner
> On Fri, Sep 30, 2011 at 5:11 AM, juaninf wrote:
> > Hi everybody,
> >
> > I want implement a
On Fri, Sep 30, 2011 at 5:11 AM, juaninf wrote:
> Hi everybody,
>
> I want implement a extend Euclidean Algorithm ( to solve a(x)
It's already in Sage. Type
xgcd?
for further details.
> congruence b(x)R(x) mod (g(x))), (egcd
> function), but this give wrong results, below my egcd, please hel
Hi everybody,
I want implement a extend Euclidean Algorithm ( to solve a(x)
congruence b(x)R(x) mod (g(x))), (egcd
function), but this give wrong results, below my egcd, please help me
to fix ...
I am testing with inverse multiplicative from output of xgcd
def egcd(p1,p2):
if p2 == PR(0):
