An Efficient Algorithm to Find All Primes in A Given Interval

Authors : Farhat MECHKENE

Pages : 74-77

View : 17 | Download : 4

Publication Date : 2019-12-31

Article Type : Research Paper

Abstract :In this paper, we propose a deterministic algorithm for primality testing and primes search in a given integer interval. The algorithm use a new primality test method, which replace modulo operator with elementary arithmetic operations, hence a better efficiency than divisibility test. The algorithm is working; it generates a prime base by an expansion process and is appropriate for a fast search for small primes insert ignore into journalissuearticles values(a dozen of digits);. We propose a filtering method to overcome memory constraints, and use the algorithm to expand much more the prime base and find medium size primes insert ignore into journalissuearticles values(dozens of digits);.
Keywords : Finding all frimes in an interval, deterministic algorithms for primality testing