Sequence eliminating function (SEF) and the interval formulas of prime numbers

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