This is an implementation of a prime number sieve.
The three most important classes are:

All other classes are supporting classes.

Our intention is to show that the famous algorithm of Eratosthenes (276 - 194 BC) is not a silly hack to teach C-programmers how to flip bits and shift masks, but is a wonderful tool to explore the prime numbers. And to give an up-to-date implementation which makes use of the new features of Java 5 and CSharp. Click on the links on the left hand side to study the source code and the docs.

/* Copyright (C) 2004 Peter Luschny, All rights reserved.
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files ("the Software"), to deal in the Software without
* restriction, including without limitation the rights to use,
* copy, modify, merge, publish, distribute, sublicense, and / or
* sell copies of the Software, and to permit persons to whom
* the Software is furnished to do so, subject to the following
* conditions:
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
* Comments and bug reports please mail to: peter@luschny.de