9 Apr 12:53 2013

## besout

Abdelwaheb Miled <abdelwahebmiled <at> gmail.com>

2013-04-09 10:53:10 GMT

2013-04-09 10:53:10 GMT

I'm pleased to announce that I've uploaded the *besout* package to hackage.

http://hackage.haskell.org/package/besout

*besout* is intended to compute extended gcd of polynomials over F_p[x]. The three main functions of *besout* are :

*multPolyZ* : product of two polynomial P , Q in F_p[x] using a technique similar to Horner rules.

*euclidanPolyMod* : quotient and remainder of euclidean division of polynomial P by Q in the ring F_p[x] where p is a prime number.

*extendedgcdpoly* : extended gcd of polynomials P and Q in the ring F_p[x] where p is a prime number.

I am open to suggestions.

Abdelwaheb Miled

http://hackage.haskell.org/package/besout

*besout* is intended to compute extended gcd of polynomials over F_p[x]. The three main functions of *besout* are :

*multPolyZ* : product of two polynomial P , Q in F_p[x] using a technique similar to Horner rules.

*euclidanPolyMod* : quotient and remainder of euclidean division of polynomial P by Q in the ring F_p[x] where p is a prime number.

*extendedgcdpoly* : extended gcd of polynomials P and Q in the ring F_p[x] where p is a prime number.

I am open to suggestions.

Abdelwaheb Miled

_______________________________________________ Haskell mailing list Haskell <at> haskell.org http://www.haskell.org/mailman/listinfo/haskell