| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Mtsieve"
(person link) |
(more data) |
||
| Line 1: | Line 1: | ||
| + | {{InfoboxProgram | ||
| + | |title=Mtsieve | ||
| + | |workload=[[Sieving program|Siever]] | ||
| + | |release=V 1.9.2 | ||
| + | |latest=2019-06-18 | ||
| + | }} | ||
==Description== | ==Description== | ||
'''Mtsieve''' is a multi-threaded sieve framework for different [[sieving program]]s developed by [[Mark Rodenkirch]]. | '''Mtsieve''' is a multi-threaded sieve framework for different [[sieving program]]s 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 number]]s | ||
| + | *cksieve: search for factors of [[Carol-Kynea prime]]s | ||
| + | *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|+|k|b|n}} and {{Kbn|k|b|n}} | ||
| + | *fkbnsieve: search for factors of the form k*b<sup>n</sup>+c for fixed k, b, and n and variable c | ||
| + | *gfndsieve: search for factors of {{Kbn|+|k|n}} | ||
| + | *kbbsieve: search for factors of numbers of the form {{Kbn|+|k|b|b}} or {{Kbn|k|b|b}} for fixed k and variable b | ||
| + | *xyyxsieve: search for factors of x<sup>y</sup>+y<sup>x</sup> and x<sup>y</sup>-y<sup>x</sup> | ||
| + | *gcwsieve: search for factors of [[Gen. Cullen prime]]s and [[Gen. Woodall prime]]s | ||
| + | *psieve: search for factors of Primorials | ||
| + | *twinsieve: search for factors of [[twin prime]]s | ||
| + | *dmdsieve: search for factors of number of the form 2*k*(2<sup>p</sup>-1)+1 (potential divisors of [[Double Mersenne number]]s) | ||
==External links== | ==External links== | ||
Revision as of 12:13, 19 June 2019
| Workload type | Siever |
| First release | V 1.9.2 |
| Latest version | 2019-06-18 |
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•bn+1 and k•bn-1
- 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
- kbbsieve: search for factors of numbers of the form k•bb+1 or k•bb-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 number of the form 2*k*(2p-1)+1 (potential divisors of Double Mersenne numbers)
External links
Sieving program
| Program |
| Tools |
| Links |
