|
|
|
|
| ||
|
|
|
Is your PC slow? Slow downloads? click here, and speed up your PC!
Create both Websites and CD catalogs with a single professional tool:
(BELOW!) FREE DOWNLOAD LINKS FOR:
Prime or not 5.0
Using tools:-The Tester: a fast way to test the primality of a number (up to E200);-The Divisors finder: find all the divisors of a number;-The Search engine: define an interval and get all the prime numbers in ranging inside, with the amount of found prime numbers.-The Splitter: get all prime divisors, Prime generator...You can save the prime numbers' list into files for further views. (description, more information, click here - Search, count, save and find primes then prove their primality.) File size: 441 Kb Free Download link 1: Click here to start the download for Prime or not (then choose Save)Search, count, save and find primes then prove their primality.Using 4 tools:-The Primality Tester.-Mersenne numbers tester.-The Divisors finder.-The Search engine.-The convertor: Mersenne form-Fermat form-integer-The Splitter...(Search, count, save and find primes then prove their primality.)This is the download page for Prime or not - Search, count, save and find primes then prove their primality.
Using Prime or not ! you can find these prime numbers up to E200 and test their primality. Prime or not! (you may call him PON now! ), also performs tests on Mersenne's numbers up to the 99 999th; A Mersenne number has the form (2^p)-1 ; which make of the 99 999th a number with 35 000 digits! You can find all the primes ranging inside an interval you designed using its powerful tool: Prime Search Engine. PON includes a Prime Generator, thus you reach the next prime ahead any entry. With its handy interface, all you have to do is to type up the number and click on the button to perform the tests above, factorize, find the prime factors, verify various conjectures. Also a new tool: The Convertor, will help you to do transformations on expressions from the Mersenne form, Fermat form, integer... Perhaps you want to handle large integers on your calculations, so you need Super Calculator which performs the basic operations and GCF on numbers upto 200 digits. More to come... - Free technical support by e-mail, - All minor updates for free.
|
|
||
|
|
|
|



