Author: Mersenne Prime Search
Date: 08/15/2014 08:12 PM
Size: 4.1 MB+
Requires: Win 8 / Win 7 / Vista/ XP
Downloads: 441991 times
[ Comments Screenshots ]
TIP: Click Here to Repair/Restore Missing Windows OS Files
Report a Bad Link
Mersenne numbers can be proved composite (not prime) by either finding a factor or by running a Lucas-Lehmer primality test.
Prime numbers have long fascinated amateur and professional mathematicians. An integer greater than one is called a prime number if its only divisors are one and itself. The first prime numbers are 2, 3, 5, 7, 11, etc. For example, the number 10 is not prime because it is divisible by 2 and 5.
A Mersenne prime is a prime of the form 2P-1. The first Mersenne primes are 3, 7, 31, 127, etc. There are only 40 known Mersenne primes.
There are two ways to use this program. The automatic way uses a central server, which we call the PrimeNet server, to get work to do and report your results. Anyone with Internet access, including AOL, CompuServe, and dial-up ISP users should use this method. You do not need a permanent connection to the Internet.
The second method is the manual method. It requires a little more work and monitoring. Recommended for computers with no Internet access or with some kind of firewall problem that prevents the automatic method from working.
Version History for Prime95:
1. Option to make a noise if a PRP is found. Feature added to next release.
2. Option to scale "iterations between screen outputs" so that all worker windows output at roughly the same rate. Feature added to next release.
3. Option to update the worker window title more frequently than outputs to the worker window. Feature added to next release.
4. Per iteration screen output upgraded. It includes ETA. Classic output optionally available. Feature added to next release.
5. Benchmarking code updated. It now starts at 1024K. Multi-threaded benchmarks are now run only on the most useful combinations. For example, a quad-core hyperthreaded benchmark runs on 1 cpu, 1 cpu hyperthreaded, 2 cpus, 3 cpus, 4 cpus, and 4 cpus hyperthreaded. The trial factoring benchmark is not run by default.
6. Benchmarking also runs a multiple-worker test to measure memory bandwidth related degradation.
7. Many new undoc.txt options for benchmarking.
8. Centos 5.10 will be used to create future Linux executables. Hopefully this will help with reported GLIBC version number problems when building with Ubuntu 12.04.
9. Zero-padded non-base-2 AVX FFTs larger than 6K produced garbage for the roundoff error. Fixed in 28.5.
Like it? Love it? Leave a comment below. Please note that comments requesting support or pointing out listing errors will be deleted. Visit our Support Forums for help or drop an email to mgnews @ majorgeeks.com to report mistakes. Thank you!
comments powered by Disqus
comments powered by Disqus