Search Results for "proth"
Sort By:
Showing 2 open source projects for "proth"
View related business solutions-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
$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.
-
1
EMsieve
A simple sieve/prefactor program for Eisenstein-Mersenne Primes
...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. A sample implementation (a patch to the LLR program) is available from Batalov. [1] P.Berrizbeitia B.Iskra, 2010; http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.189.311 [2] OEIS: http://oeis.org/ -
2
GJSieve
A basic prime number sieve/tester.
If you are looking for the 64-bit version, find it here: http://sourceforge.net/projects/gjsieve/files/200/gjsieve203.exe/download GJSieve is a basic, yet full-featured sieve and tester for numbers of several classifications, including Proth, Cullen, and Woodall. GJSieve is built on the GNU Multiple-Precision (GMP) integer + rational library, and is available for both Windows and OSX. Currently, the application differs greatly across platforms. This may change in the future. They both, however, do the same thing.
- Previous
- You're on page 1
- Next
