Search The Directory The Web for Home > Science > Math > Number Theory > Prime_Numbers New! Submit a site   Categories: Goldbach Conjecture *(11) Primality Proving (26) Mersenne (10) Riemann Hypothesis (7)     whatUseek Collection Sites (submit a site ):   Give your site great placement in this category in as little as two business days!     whatUseek Directory Site Listings:   A List of Prime Numbers - All of the prime numbers less than 2000000000.   A Monte-Carlo Primality Tester - The factoring problem seems very hard. But to test a number for having factors turns out to be much easier than to find them. It also helps if we supply the computer with a coin-flipping device. We now consider a Monte Carlo algorithm, i.e. one that with high probability rejects any composite number, but never a prime.   A new primality record by E. Mayer and F. Morain - Announces that MC7331=2^7331-1)/458072843161 is prime. This number has 2196 decimal digits.   Aesthetics of the Prime Numbers Sequence - Prime visualizations (both visual and auditory), applets, message board, links.   Animation of Eratosthenes' Prime Sieve - An interactive animation of the sieve of Eratosthenes to optain prime numbers (JavaScript required).   Applets for Prime Numbers - Factorization and weights of proth coefficients.   Ask Dr. Math - What is a prime number? How can you find prime numbers? What's the 'Sieve of Eratosthenes'? What's the largest known prime?   Brief Findings From Primality Tests On (2^i+1) Family Of Sequences - The number theoretic properties of the i^j+1 type of number sequences are investigated within the computing capabilities of a Pentium Pro PC. This paper reports briefly on some of the findings.   Cryptography and Coding Theory with MAPLE page - Some coding theory and cryptography links (most of which use MAPLE).   Detecting False Reports In Primality Tests By The Oddcomp(z) Method - Public-key algorithms need plenty of prime numbers. There are more primes than the number of atoms in the universe. All standing trees on planet Earth will not be sufficient to produce paper pulp to publish all the 512-bit primes in bound volumes. How do we detect false reports by probabilistic primality tests?   Dr. Nicely's Home Page - Twin primes and Brun's number up to 10^14.   EFF Cooperative Computing Awards - Cash prizes for discovery of very large prime numbers.   Elliptic Curve Primality Proving Algorithm - The ECPP is a modern method of primality proving that does not require auxiliary factorizations. Instead, ECPP uses the sizes of groups of rational points on elliptic curves modulo n.   Entropy and Prime Numbers - Entropy of a nonnegative adjacency matrix related to prime numbers.   Finding Primes and Proving Primality (The quick tests) - For finding all the small primes, say all those less than 10,000,000; the most efficient way is by using the Sieve of Eratosthenes (ca 240 BC)   Formulae for Determining Primality or Compositeness. - This is a method to produce formulas of various complexities with real coeffecients whose itereation indicate whether a given integer is prime or composite.   Formulae for Primes - The formula of Jones, Sato, Wada and Wiens: the set of primes is the set of positive values taken by this fexpression.   Generalized Fermat Prime Search - Software, results and other resources.   Hardy-Littlewood Constants - Infinite series over primes are the main topic in Hadamard-de la Vallée Poussin constants and in Brun's constant.   It's About Prime - Capable of factoring numbers as large as 2^64 - 1 with the standard Macintosh Interface using custom routines.     [ 1 2 3 4 ] Help build the largest human-edited directory on the web.   Submit a Site - Open Directory Project - Become an Editor

About   Help   Content Filter   Terms   Privacy Policy © 2018 whatUseek