calculates the prime numbers 1..N, tells you if N is prime etc.
Prints tables of primes.
Computes the prime just below or above N.
It is useful in computing optimal Hashtable sizes.
Java source included.
Keywords: prime, Eratosthenes, sieve, number, division, remainder, modulus
Recent Changes: mostly cosmetic, more documentation, tidy source.
Install Support: No Install Support
Supported Languages: English
Additional Requirements: Java 1.7+