  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 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 .  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 website Mathematics & 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
 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  Online videos : Go to videos of the UMCC EasyPrimes :
 Download  EasyPrimes offer  Presentation of the software << EasyPrimes >> Solution for generating prime numbers and accounting for primes and not primes numbers A software providing powerful features Counting prime numbers in the range (0 .. N or N1..N2) Generator primes Resolution of 2 Diophantine equations     