  We will derive a function that eliminates any sequence of equidistant numbers
from the integer numbers, then we will derive its inverse.
  Then we will use the Sequence elimination function to eliminate the multiples
of the prime numbers from the integer numbers to produce formulas that generate
all prime numbers in some interval.
