EasyPrimes
Counting prime numbers in the range (0 .. N N1 or N2 ..)
* Determining the exact number of primes in an interval
* Accurate determination of the number of non-prime odd numbers in a range
* Measure the density of primes
First functionality of UMCC software : Functionality exporting emails from Lotus to the desktop or Windows Explorer
Generator primes
* Formula FMW (n) = 3 ^ 2 (n +1)
* Formula Fgwm1 (n) = 4.n. (n +1) -1

Several primality tests are offered (Rabin-Miller, ECPP, AKS, specific tests)
Second functionality of UMCC: Functionality import emails from office or windows explorer to the software IBM Lotus Notes Domino.
Resolution of 2 Diophantine equations
*  The first equation is used to find the first odd number composed of any number of odd numbers. It is then easy to find all the others.
*  The second equation solves the Diophantine character of the exponential
2 ^ a = b .
Third functionality: Functionality Import/Export/archive created by a simple drag/drop or copy/paste.
Main features
The EasyPrimes software is the solution for very large prime numbers..
Main features are:
The EasyPrimes software is available in 2 languages : French  and English.
For more information contact us and check the online demos.
All formulas on which this software is based are explained on the websiteMathematics & Science
EasyPrimes
Professional
Standard
main features
Version 1.0
Version 1.0
The results obtained with the EasyPrimes software, such as prime numbers, are  they used commercially ?
YES
NO
Personal or research use
See licensecommercial use
Counting prime numbers in the range (0 .. N N1 or N2 ..)
* Determining the exact number of primes in an interval
* Accurate determination of the number of non-prime odd numbers in a range
* Measure the density of primes
Generator primes
* Formula FMW (n) = 3 ^ 2 (n +1)
* Formula Fgwm1 (n) = 4.n. (n +1) -1
Several primality tests are offered (Rabin-Miller, ECPP, AKS, specific tests)
Resolution of 2 Diophantine equations
*  The first equation is used to find the first odd number composed of any number of odd numbers. It is then easy to find all the others.
* The second equation solves the Diophantine character of the exponential 2 ^ a = b
No result
Image indicating the video viewing of the Software "UMCC for Lotus Notes".
Buy now your software of Generator primes
Online videos :
Online demo by video
Go to videos of the UMCC EasyPrimes :
DownloadDownload the offer for "UMCC  for Lotus Notes" in PDF  format.
Download the offer for UMCC
EasyPrimes offer
Buy now your software interoperability messaging (converting and archiving your email)
Presentation of the software << EasyPrimes >>
Solution for generating prime numbers and accounting for primes and not primes numbers
UMCC software for extracting and archiving Lotus Notes messages in different formats (Outlook, Outlook Express, Web, Lotus).
A software providing powerful features
Counting prime numbers in the range (0 .. N or N1..N2)
Software feature No. 1
Generator primes
Software feature No. 2
Resolution of 2 Diophantine equations
Software feature No. 1