Show by a sieve argument that the number of square free integers not exceeding $x$ is less than $x\prod_p\left(1-\frac{1}{p^2}\right)+o(x),$where the product extends over all primes.
I happened to see this exercise this morning, and still fail to prove it. Could you give me a proof?