Estimating the sum of reciprocals of products of two primes

Question

It's rather well-known that $$ \sum_{p \leq X} \frac{1}{p} \sim \log \log X,$$ where this is a sum over the positive integer primes. Can we efficiently estimate the sum $$ \sum_{p,q \leq X} \frac{1}{pq}$$ where both $p,q$ range over positive primes up to $X$?

Answer 1

(sorry this is my complete answer) An easy consequence of the prime number theorem is that if the real function F(x) is monotonic and is bounded by a polynomial for large x, and if S(x) is the sum of F(p) over primes p less than x, then S(x) is asymptotic to the integral of F(y)/log y , from y=2 to y=x. It also easily extends to functions of more than one variable. Integrating F(y,z)/(log y . log z) from y and z each from 2 to x gives the square of log(log x), to within a constant, which is your answer.

Answer 2

$$\sum_{p,q\leq X}\frac{1}{pq}=\sum_{q\leq X}\frac{1}{q}\sum_{p\leq X}\frac{1}{p}=\left(\log\left(\log\left(X\right)\right)\right)^{2}+O\left(\log\left(\log\left(X\right)\right)\right) $$ from $$\sum_{p\leq X}\frac{1}{p}=\log\left(\log\left(X\right)\right)+O\left(1\right).$$ You can get a better approximation using $$\sum_{p\leq X}\frac{1}{p}=\log\left(\log\left(X\right)\right)+M+O\left(\log^{-1}\left(X\right)\right) $$ where $M $ is the Meissel–Mertens constant.