Sequence elimination function and the formulas of prime numbers

TL;DR

This paper introduces a sequence elimination function and its inverse to systematically remove equidistant numbers, specifically multiples of primes, from integers, leading to formulas that generate prime numbers within certain intervals.

Contribution

The paper presents a novel sequence elimination function and formulas for generating prime numbers, offering a new approach to prime number characterization.

Findings

Derived a sequence elimination function for equidistant numbers

Formulated inverse of the elimination function

Produced formulas generating primes within intervals

Abstract

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.