For every m ≥ 2 there is a string of m consecutive primes in which every pair is symmetric, and the number of symmetric primes up to x is bounded by π(x)/(log x)^η (log log x)^O(1) with the conjectured exponent η.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Symmetric primes revisited
For every m ≥ 2 there is a string of m consecutive primes in which every pair is symmetric, and the number of symmetric primes up to x is bounded by π(x)/(log x)^η (log log x)^O(1) with the conjectured exponent η.