Ok so I will look at the squeak version. On Feb 2, 2012, at 11:07 PM, Nicolas Cellier wrote:

Do you mean http://code.google.com/p/pharo/issues/detail?id=4997 ?

In any case, finding a divisor with a naive iteration on all odd numbers is not the thing to do. Programming a deterministic and efficient primality test is a hard thing... I suggest to simply pick squeak version and let isPrime implemented in term of isProbablyPrime for large integers, put a comment why.

Nicolas

2012/2/2 Stéphane Ducasse <stephane.ducasse@inria.fr>:

...

thanks Nicolas could you have a look at the prime number generation issue?

Stef