General Prime Numbers

University:
Augusta University
Course:
MATH 4800 | Secondary Mathematics from an Advanced Perspective
Academic year:

2023
Views:

128

Pages:

3
Author:

Aries D.

General prime Numbers CEP (L): For KE1..L is. Primex 1 K2 While jL Whik JAL lis-Primep KK+1 JE1 For KE 1..L if is Primek=1 Primej K JEJTI return frime it is well known that the segmented hersion of the seive of eratosthenes, with basic optimizations, user (L) Operations and 2) 109(109(11)) log (L) GENERATING PRIME NUMBERS Hostam 1.2. This program is a better Version CF Program 11 because It Fots O only on the add Fositions of the Vector is Aime (EPI (L):= For KE 3,5... is. Primer 1 For KE 3.5.. floor (ㄷ) ForJ EK², K²+2k..L Prime2 J42 Fork E1.3..L is-Primejo if is Prime=1 Frimej K return Prime Program 1.3. This program is a better orsion of Program 1-2 because it user aminimal memory space. CEPm (L): ← Floor ForkE1.. is Prime 1 For KE 3.5.- Floor (VI). Forj Ek², k²+2k..L is Prime 0 Pimen 4-2 Fork E1..-1 if is primex=1 Prime; 2.K+1 return Prime Even the execution time of the frogram 1.3 is a little long than of the Program 1.2 the best linear Variant of the serve of eratosthenes is the program 1.3 at is Provides an importar memory economy (11270607) Memory locations instead of 21270607, the amat of memory locations used by programs 1.1 and 1.27