Let $ A_n$ represent the number of integers that can be written as the product of two element of $ [[1,n]]$ .

I am looking for an asymptotic estimation of $ A_n$ .

First, I think it’s a good start to look at the exponent $ \alpha$ such that :

$ $ A_n = o(n^\alpha)$ $

I think we have : $ 2 < alpha $ . To prove this lower bound we use the fact that the number of primer numbers $ \leq n$ is about $ \frac{n}{\log n}$ . Hence we have the trivial lower bound (assuming $ n$ is big enough) :

$ $ \frac{n}{\log n} \cdot \binom{ E(\frac{n}{\log n})}{2} = o(n^3)$ $

Now is it possible to get a good asymptotic for $ A_n$ and not just this lower bound ? Is what I’ve done so far correct ?

Thank you !