2021/02/12 by Ahmed Diab, Diab, Ahmed
Computer Science · Engineering · #Diverse Scientific and Engineering Research #FOS: Mathematics #Image Processing and 3D Reconstruction #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.2102.06653
openalex publication_date 2021/02/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We make two algorithms that generate all prime numbers up to a given limit, they are a development of sieve of Eratosthenes algorithm, we use two formulas to achieve this development, where all the multiples of prime number 2 are eliminated in the first formula, and all the multiples of prime numbers 2 and 3 are eliminated in the second formula. Using the first algorithm we proof sieve of Sundaram's algorithm, then we improve it to be more efficient prime generating algorithm. We will show the difference in performance between all the algorithms we will make and sieve of Eratosthenes algorithm in terms of run time.