Search Results for "prime os mod"
Sort By:
Showing 2 open source projects for "prime os mod"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
1
EMsieve
A simple sieve/prefactor program for Eisenstein-Mersenne Primes
A simple sieve/prefactor program for the so-called Eisenstein-Mersenne Primes: 3^p +- 3^((p + 1)/2) + 1. See http://oeis.org/A125738, A125739 and [1] for a good introduction. Some easily established properties are: p must be prime; sign is minus for p=+-1 (mod 12), plus otherwise; composites only have factors of form 6kp+1 (integer k). Related probable primes (3^p -+ 3^((p + 1)/2) + 1)/7 are sieved at the same time. See http://oeis.org/A125743, A125744. After sieving, the Berrizbeitia-Iskra or a Proth test can be run; this is best implemented with FFT mod (3^3p+1) using GWNUM library. ... -
2
MuPuPriNT
A primality/compositeness tester for different types of numbers.
MuPuPriNT (Multi-Purpose Prime Number Tester) is a primality and compositeness tester for many different types of numbers. It is basic, yet full-featured, and offers several different testing methods for each type of number. MuPuPriNT is built on the GNU Multiple-Precision (GMP) integer + rational library, and is available for Windows, OS X, and Linux. Source code is available as well, and can be built on any machine with Qt installed.
- Previous
- You're on page 1
- Next
