Navigation
Topics Register • News • History • How to • Sequences statistics • Template prototypes

Mtsieve

From Prime-Wiki
Jump to: navigation, search
Mtsieve
Workload type Siever
First release 2018-02-10
Latest version 2.0.6
2020-09-17

Description

Mtsieve is a multi-threaded sieve framework for different sieving programs developed by Mark Rodenkirch.

Included software

The package contains all C-sources and Windows executables.

The following tools are included:

  • afsieve: search for factors of Alternating Factorials
  • mfsieve: search for factors of Multifactorial numbers
  • cksieve: search for factors of Carol-Kynea primes
  • pixsieve: search for factors of a long decimal string where each successive term adds on decimal digit to the end of the previous decimal term
  • fbncsieve: search for factors of numbers in the form kbn+1 and kbn-1 for fixed b and n and variable k
  • fkbnsieve: search for factors of the form k*bn+c for fixed k, b, and n and variable c
  • gfndsieve: search for factors of k•2n+1, remaining terms are potential divisors of Generalized Fermat numbers
  • kbbsieve: search for factors of numbers of the form kbb+1 or kbb-1 for fixed k and variable b
  • xyyxsieve: search for factors of xy+yx and xy-yx
  • gcwsieve: search for factors of Gen Cullen primes and Gen Woodall primes
  • psieve: search for factors of Primorials
  • twinsieve: search for factors of twin primes
  • dmdsieve: search for factors of numbers of the form 2*k*(2p-1)+1 (potential divisors of Double Mersenne numbers)
  • k1b2sieve: search for factors of the form 2n+c for variable n and c
  • sgsieve: eliminates terms for Sophie-Germain prime searches for base 2, fixed n and variable k
  • srsieve2: search for factors of k*bnn+c for fixed b and variable k and n

External links

Sieving program