| What's Cool - The Top 10! |
|
curiosities
Prime Curios!
- An exciting collection of prime number curiosities, integer wonders, amusing factorizations, and surprising trivia.
pop
(Added: 5-Aug-2000 Hits: 11418 Rating: 7.36 Votes: 11) Rate It
lists of primes : small primes
All prime numbers less than 10,000,000,000
- Browse all prime numbers of less than 11 digits. A prime number checker facility is also included.
pop
(Added: 4-Feb-2004 Hits: 9491 Rating: 6.71 Votes: 7) Rate It
lists of primes : small primes : first n primes
The first 1,000 primes
- This is a list of the first 1,000 primes
pop
(Added: 22-Jul-2000 Hits: 14765 Rating: 7.40 Votes: 29) Rate It
programs : large arithmetic
Primes
- Primes is a search tool for prime numbers. It allows you to search primes in different manners, and can generate primes of up to 200 digits (or more).
pop
(Added: 2-Oct-2000 Hits: 9622 Rating: 6.48 Votes: 19) Rate It
programs : seeking large primes
Yves Gallot's Proth.exe
- Classical n+1 testing for primes of special forms. Easy interface
forfinding twins, Sophie Germain's... Most of the 5000 largest known primes were found with this program.
pop
(Added: 2-Aug-2000 Hits: 10823 Rating: 7.62 Votes: 40) Rate It
programs : sieves : Eratosthenes : C source code
C-code by Frank Pilhofer
- The author says "My implementation..is not only fast but also saves memory, and its macros are almost completely ununderstandable."
pop
(Added: 3-Aug-2000 Hits: 19159 Rating: 7.48 Votes: 23) Rate It
Robert Bennion's Hopping Sieve
- "The hopping sieve" was developed by Robert Bennion at the University of Utah in the early 1970s. This sieve MAY have advantages over other methods if you have a small or slow cache memory.
This page contains links and C source code.
pop
(Added: 3-Aug-2000 Hits: 8658 Rating: 3.50 Votes: 2) Rate It
programs : sieves : binary quadratic
Sieve of Atkins
- This version generates the 50847534 primes up to 1000000000 in just 8 seconds on a Pentium II-350; it prints them in decimal in just 35 seconds.
pop
(Added: 3-Aug-2000 Hits: 15238 Rating: 6.83 Votes: 25) Rate It
theory : finding and proving
How to find primes and prove primality
- A series of pages introducing the classical methods from trial division to the n2-1 tests
(e.g., Lucas-lehmer, Pepin, Proth)
followed by a brief discussion of the modern tests.
pop
(Added: 3-Aug-2000 Hits: 8818 Rating: 7.00 Votes: 3) Rate It
visualization : via images
A visual representation of the primes
- The author says: "This is derived from the primes, in a definite way; but is for beauty rather than information purposes."
pop
(Added: 3-Aug-2000 Hits: 9835 Rating: 8.63 Votes: 8) Rate It
| |
