Mprime

Jul 20, 2023

This program is used to find Mersenne Prime numbers as part of Great Internet Mersenne Prime Search initiative GIMPS since 1996. See http//primes.utm.edu/mersenne/index.html for a description of Mersenne primes.

Mersenne number can be proved composite not prime by either finding a factor or by running a Lucas-Lehmer primality test.

To use this program you must agree to the terms and conditions, prize rules, etc. at https//www.mersenne.org/legal/.



Checkout these related ports:
  • Zn_poly - C library for polynomial arithmetic
  • Zimpl - Language to translate the LP models into .lp or .mps
  • Zegrapher - Software for plotting mathematical objects
  • Zarray - Dynamically typed N-D expression system based on xtensor
  • Z3 - Z3 Theorem Prover
  • Yices - SMT solver
  • Yacas - Yet Another Computer Algebra System
  • Xtensor - Multi-dimensional arrays with broadcasting and lazy computing
  • Xtensor-python - Python bindings for xtensor
  • Xtensor-io - Xtensor plugin to read/write images, audio files, numpy npz and HDF5
  • Xtensor-blas - BLAS extension to xtensor
  • Xspread - Spreadsheet program for X and terminals
  • Xppaut - Graphical tool for solving differential equations, etc
  • Xplot - X11 plotting package
  • Xlife++ - XLiFE++ eXtended Library of Finite Elements in C++