I am implementing two versions of Eratosthenes's Sieve, the first one is imperative: let primesUntilArray n = let isqrt x = let mutable root = 0UL let mutable p = 1UL <<< ...

I'm trying to implement an efficient segmented prime sieve in C. It's basically a sieve of Eratosthenes, but each segment is split to a size that can well fit in cache. In my version, there is a bit a...

I am new to SML. I am trying to create a function that outputs a list of all prime numbers which are smaller than or equal to a given integer n > 2 using the Sieve of Eratosthenes. I am running int...

tl;dr How do you get an extremely large 80 digit BigInt exact prime, not a "probable" prime? It appears the code I have found and attached below only gives you a "probable" prime. ...