Prime or not 5.0
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.
Recent changes in this Major Update:
Handles larger numbers up to E200; Mersenne's numbers; Goldbach conjecture;Eisenstein sum:Enhanced functions; Super calculator; updated Search engine capacity
Comments (Add comment)
Price $ 25
File size: 441 Kb
Install support: No Install Support
OS: Win95, Win98, WinME, WinNT 3.x, WinNT 4.x, WinXP, Windows2000, Windows CE
System requirement: 24 MB RAM