The Linear and Quadratic Nature of Sequences for Determining Prime Numbers by Elimination of Composites

Abstract

A previously derived set of sequences for generating prime numbers is modified by various algebraic and trigonometric manipulations. The modified sequences are then used to more efficiently generate prime numbers. The modified sequences are simplified from their original form and are much easier to implement into a computer program. It is shown by computation that the modified sequences more efficiently determine prime numbers because the modified sequences provide flexibility with their implementation. The added flexibility allows for the removal of redundancy in the overall process, which decreases the amount of data to process; thus, the efficiency of the prime number generator is significantly improved.