# Difference between revisions of "Mtsieve"

(more data) |
(update version) |
||

Line 3: | Line 3: | ||

|workload=[[Sieving program|Siever]] | |workload=[[Sieving program|Siever]] | ||

|release=2018-02-10 | |release=2018-02-10 | ||

− | |latest=1.9. | + | |latest=1.9.3<br>2019-07-25 |

}} | }} | ||

==Description== | ==Description== |

## Revision as of 02:52, 26 July 2019

Workload type |
Siever |

First release |
2018-02-10 |

Latest version |
1.9.3 2019-07-25 |

## 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 k•b
^{n}+1 and k•b^{n}-1 for fixed b and n and variable k - fkbnsieve: search for factors of the form k*b
^{n}+c for fixed k, b, and n and variable c - gfndsieve: search for factors of k•2
^{n}+1, remaining terms are potential divisors of Generalized Fermat numbers - kbbsieve: search for factors of numbers of the form k•b
^{b}+1 or k•b^{b}-1 for fixed k and variable b - xyyxsieve: search for factors of x
^{y}+y^{x}and x^{y}-y^{x} - 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 number of the form 2*k*(2
^{p}-1)+1 (potential divisors of Double Mersenne numbers)

## External links

**Sieving program**

Program |

Tools |

Links |