9 research outputs found
Average prime-pair counting formula
Taking , let denote the number of prime pairs
with . The prime-pair conjecture of Hardy and Littlewood (1923) asserts
that with an explicit constant
. There seems to be no good conjecture for the remainders
that corresponds to
Riemann's formula for . However, there is a heuristic
approximate formula for averages of the remainders which is
supported by numerical results.Comment: 26 pages, 6 figure
Average prime-pair counting formula
Taking , let denote the number of prime pairs with . The prime-pair conjecture of Hardy and Littlewood (1923) asserts that with an explicit constant . There seems to be no good conjecture for the remainders \om_{2r}(x)=\pi_{2r(x)-2C_{2r}\,{\rm li}_2(x) that corresponds to Riemann's formula for . However, there is a heuristic approximate formula for averages of the remainders \om_{2r}(x) which is supported by numerical results
Heuristics on pairing-friendly elliptic curves
We present a heuristic asymptotic formula as for the number of
isogeny classes of pairing-friendly elliptic curves with fixed embedding degree
, with fixed discriminant, with rho-value bounded by a fixed
such that , and with prime subgroup order at most .Comment: text substantially rewritten, tables correcte
Average prime-pair counting formula
Taking , let denote the number of prime pairs with . The prime-pair conjecture of Hardy and Littlewood (1923) asserts that with an explicit constant . There seems to be no good conjecture for the remainders \om_{2r}(x)=\pi_{2r(x)-2C_{2r}\,{\rm li}_2(x) that corresponds to Riemann's formula for . However, there is a heuristic approximate formula for averages of the remainders \om_{2r}(x) which is supported by numerical results