Multi-backend ECM stage-1 engine (OpenCL · CUDA/CGBN · AVX-512 IFMA) with GMP-ECM & Prime95 savefile interop and a worktodo queue manager. Windows, Linux & Android
-
Updated
Oct 3, 2026 - C
#
mersenne-primes
Here are 7 public repositories matching this topic...
This library help to find prime numbers between given range
prime mersenne-primes twin-primes wilson-primes sophie-germain-primes wieferich-primes factorial-primes circular-primes cousin-primes balanced-primes palindromic-primes reversible-primes pythagorean-primes permutable-primes wagstaff-primes fermatpseudoprimes semi-primes lucas-primes primorial-prime truncatable-primes
-
Updated
Jan 8, 2023 - Python
Generate Mersenne prime numbers into files (C++)
-
Updated
Mar 14, 2025 - C++
Several large scale mathematical problems were solved using the computer's excellent calculating ability and python.
palindrome factorial hcf fibonacci-sequence collatz-conjecture lcm prime-factorisation multiplicative-persistence mersenne-primes twin-primes perfect-numbers decimal-binary-octal cumulative-sum total-time-between-two-dates
-
Updated
Oct 21, 2022 - Python
Гибридный CPU/GPU поиск простых обобщённых репьюнитов R_b(n)=(b^n-1)/(b-1) и статья: точный условный критерий константы Ленстры — Померанса — Вагстаффа
rust reproducible-research cuda prime-numbers gpu-computing oeis number-theory mersenne-primes repunit
-
Updated
Oct 1, 2026 - TeX
All even perfect numbers are constructively classified using the Euclid–Euler formula. Non-constructive elimination confirms no other forms exist. すべての偶数完全数は Euclid–Euler の公式により構成的に分類され、形式外の完全数は非構成的に否定される。
math proof classification number-theory even-numbers mersenne-primes perfect-numbers constructive-proof euclid-euler
-
Updated
Jul 2, 2025 - Python
Reusable OpenCL register arithmetic engine derived from GPUOwl/PRPLL, with a Marin-inspired engine interface
-
Updated
Oct 3, 2026 - C++
Add this topic to your repo
To associate your repository with the mersenne-primes topic, visit your repo's landing page and select "manage topics."