Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] primality test for Big_int ?
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2003-09-01 (12:19)
From: Francesco Abbate <france.abbate@t...>
Subject: [Caml-list] primality test for Big_int ?
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 <>

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: