Upper-bound sieve (source code)

= Upper-bound sieve

An upper-bound sieve bounds the size of a sifted set from above. In a dimension-one problem with one forbidden class modulo each relevant prime $p$, its main density factor is comparable to $\prod_p(1-1/p)$.