Conjecture 64. NUMBER OF PRIME TWINS

Werner Sand sent the following conjecture:

Let p,q (p<q) be a prime twin.

Let “the sum of prime twins” be the sum of the upper partners q.

Let π2(x) be the number of prime twins below x.

Conjecture:

The number of prime twins below x is asymptotically equal to half the sum of prime twins below the square root of x:

π2(x) ~ ½ sum q (q=5..sqrt x) or:

The number of prime twins below x² is asymptotically equal to half the sum of prime twins below x:

π2(x²) ~ ½ sum q (q=5..x)

Generalization to triplets… k-tuples (constellations) see here.

Q. Can you prove it?

Enoch Haga wrote:

In A093683 I have number of twin primes under 10^n
In A139677 we have the approximate sums
See below: last number is sqrt of ~sums
4, 32, 5.66 Over
25, 820, 28.64 Over
174, 24676, 157.09 Under
1270, 1761248, 1327.12 Over
10250, 109650716, 10471.42 Over 86027, 7482340880, 86500.53 Over
738597, 543121286660, 736967.63 Under
6497407, 41216742789192, 6420026.70 Under (about 1.2%

The computation supports the conjecture.

***