GPU Mersenne primality test.

Mersenne prime search using integer arithmetic and an IDBWT via an NTT executed on the GPU through OpenCL.

Approach to calculating big Mersenne primes with arbitrary precision numbers.

A simple Lucas-Lehmer primality test implementation for C++

Fixed version of the same name hackage package

Simple C code which searching for Mersenne prime about first 1M numbers

A Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form M_{n}=2^{n}-1 for some integer n.

Generates two TeX-files (which then can be used to build a pdf) for a given mersenne prime number with per-page-statistics and calculates the happy number sequence.

Collection of useful methodes and classes.

A theory describing recurring patterns at different scales through rotation operators

University project mainly involving Mersenne numbers.

Generate Mersenne prime numbers into files (C++)

Primality testing and prime factorization utility

An exploration of the integer sequence: Mersenne Primes

mersenne.click source code.

This is a Rust implementation of the Mersenne Twister (MT19937) pseudo random number generator (PRNG). This implementation allows you to generate random numbers seeded with the process ID (PID) of the running program, making the sequence of generated numbers different each time the program is run.

🔢 This repository contains easy-to-follow Number Theory problems solved using MATLAB.

Mersenne数の素因数リスト

A Mersenne Primality Test that implements the Lucas-Lehmer Test