Search Results for "sieve"

mtsieve is a framework wrapped around primesieve to distribute prime numbers to worker classes to do work with those prime numbers. The "mt" means that it is multi-threaded. The "sieve" means that the framework is typically used to eliminate candidate terms with small from a set of numbers. The numbers remaining after using mtsieve can then be used by programs such as llr and pfgw to test those numbers for primality. Another usage could be to use those prime numbers to test each for a specific characteristic, such as whether it is a Wieferich or Wall-Sun-Sun number. ...

A simple sieve/prefactor program for the so-called Eisenstein-Mersenne Primes: 3^p +- 3^((p + 1)/2) + 1. See http://oeis.org/A125738, A125739 and [1] for a good introduction. Some easily established properties are: p must be prime; sign is minus for p=+-1 (mod 12), plus otherwise; composites only have factors of form 6kp+1 (integer k). Related probable primes (3^p -+ 3^((p + 1)/2) + 1)/7 are sieved at the same time.