Steve Fan

An inequality related to the sieve of Eratosthenes

Let $Φ(x,y)$ denote the number of integers $n\in[1,x]$ free of prime factors $\le y$. We show that but for a few small cases, $Φ(x,y)<.6x/\log y$ when $y\le\sqrt{x}$.