prime number generation
1 article · search the full text for this term
-
Dynamics of Prime Gap Sets: An Algorithmic and Set-Theoretic Approach
Abstract: In this paper, we present a theorem and an efficient algorithm for computing all prime numbers up to a given integer X. Our theorem establishes a relationship between the primes up to X and those up to (X+1)2, providing a theoretical foundation for the algorithm. The proposed method improves upon the traditional Sieve of Eratosthenes by dynamically eliminating multiples of primes using only the remaining numbers in the set, thereby …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 12, Issue 3, 2025 · pp. 20–25 Read article