| 1 |
Source: mlucas |
| 2 |
Section: math |
| 3 |
Priority: optional |
| 4 |
Maintainer: Alex Vong <[email protected]> |
| 5 |
Build-Depends: debhelper-compat (= 13), libgmp-dev |
| 6 |
Rules-Requires-Root: no |
| 7 |
Standards-Version: 4.6.0.1 |
| 8 |
Homepage: https://www.mersenneforum.org/mayer/README.html |
| 9 |
Vcs-Git: https://notabug.org/alexvong1995/mlucas.git |
| 10 |
Vcs-Browser: https://notabug.org/alexvong1995/mlucas |
| 11 |
|
| 12 |
Package: mlucas |
| 13 |
Architecture: amd64 armel armhf arm64 hurd-i386 i386 kfreebsd-amd64 kfreebsd-i386 mips mipsel powerpc s390x |
| 14 |
Depends: ${shlibs:Depends}, ${misc:Depends}, python3 |
| 15 |
Description: program to perform Lucas-Lehmer test on a Mersenne number |
| 16 |
mlucas is an open-source (and free/libre) program for performing Lucas-Lehmer |
| 17 |
test on prime-exponent Mersenne numbers, that is, integers of the form |
| 18 |
2 ^ p - 1, with prime exponent p. In short, everything you need to search for |
| 19 |
world-record Mersenne primes! It has been used in the verification of various |
| 20 |
Mersenne primes, including the 45th, 46th, 48th, 49th and 50th found Mersenne |
| 21 |
prime. |
| 22 |
. |
| 23 |
You may use it to test any suitable number as you wish, but it is preferable |
| 24 |
that you do so in a coordinated fashion, as part of the Great Internet |
| 25 |
Mersenne Prime Search (GIMPS) <https://www.mersenne.org/primes/>. |