Hello everyone,

I was implementing a modular GCD algorithm for polynomial with big_int coefficients when I've discovered that there isn't any primality test in the Nums library.

Someone can help me about this question ?

If possible I would avoid to implement a primality test by myself because
- I have to study the Rabin-Miller test
- I have to implement it in C to obtain a good speed (maybe ?)

-- 
Francesco Abbate <france.abbate@tiscalinet.it>

-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners