Sieving Positive Integers by Primes | Belhaouari | Journal of Mathematics Research | CCSE

Let Q be a set of primes and let Ψ(x, y, Q) be the number of positive integers less than or equal to x that have no prime factors from Q exceeding the integer y. We have enhanced an asymptotic formula for Ψ(x; y; Q) after highlighting some properties of the function Ψ