This study suggests grouping of numbers that do not divide the number 3 and/or 5 in eight columns. Allocation results obtained from multiplication of numbers is based on column belonging to him. If in the Sieve of Eratosthenes the majority of multiplication of prime numbers result in a results devoid of practical benefit (numbers divisible by 2, 3 and/or 5), in the sieve of prime numbers using algorithms, each multiplication of prime number gives a result in a number not divisible to 2, 3 and/or 5. • Mark all numbers divisible in Table 1 by the formulas of p0;
Sieve of Prime Numbers Using Algorithms• Eliminates all the numbers in column 9 Table 2 that were marked in Table 1 according to the formulas of p0;• Fill formulas of p1 Table 2; number 49 was removed according to Table 1 no longer consider;• Repeat the operations made in step 4 and 5 according to the formulas p1;• Fill formulas of p2 Table 2 and repeat the operations in step 4 and 5. Numbers not eliminated in column 9 Table 2 are prime numbers.In column 9 we register numbers under test up to P (max). Maxim position calculation is the integer number of the maximum number being tested radical divided by 30 [2-4].Formulas belonging composite numbers are omitted. The algorithm uses formulas primes numbers squared correlating n=0,1,2,3,.... With Pn.Using the tables respecting the above algorithm complexity is much smaller, any multiple of prime number (which represents the number of position) has corresponding number is compound odd number and not divisible by 3 and/or 5. (713) Col.7=29+29n=29(899) Col.7=29+31n=29(899)