Prime Numbers: Positive natural numbers which has exactly two distinct natural number divisors 1 and itself.
Sieve Of Eratosthenes is a computer algorithm to find out prime numbers upto a specified integer starting from 2.
The time complexity of a unfaithful sieve is Θ(n2/(log n)2) ( regardless of what wikipedia might say 
)
Continue reading ‘Sieve of Eratosthenes in PhP’ »
