Sieve theory is a set of general techniques in number theory, designed to count, or more realistically to estimate the size of, sifted sets of integers. The primordial example of a sifted set is the set of prime numbers up to some prescribed limit X. Correspondingly, the primordial example of a sieve is the sieve of Eratosthenesthat there are infinitely many primes, One successful approach is to approximate a specific sifted set of numbers as example the set of prime number.
Really i'm interested in this question :
Question: Is it possible to prove Euclid theorem which stated that "there are infinitely many primes" using Sieve theory ?