  We will make two algorithms that generate all the prime numbers up to a given
limit, they are a development of sieve of Eratosthenes algorithm, we will use
two formulas of mine to achieve this development, where all the multiples of
the prime number 2 are pre-eliminated in the first formula, and all the
multiples of the prime numbers 2 and 3 are pre-eliminated in the second
formula.
  We will proof sieve of Sundaram's algorithm by using the first algorithm we
will make, then we will make some improvement to make it an efficient prime
generator algorithm.
  We will show the difference in performance between all the algorithms we will
make and sieve of Eratosthenes algorithm in terms of speed and space usage.
