Abstract: A pair of odd primes is said to be symmetric if each prime is congruent to one modulo their difference. A theorem from 1996 by Fletcher, Lindgren, and the third author provides an upper bound on the number of primes up to x that belong to a symmetric pair. In the present paper, that theorem is improved to what is likely to be the best possible result. We also establish that there exist infinitely many symmetric pairs of primes. In fact, we show that for every integer m at least 2 there is a string of m consecutive primes, any two of which form a symmetric pair.
Recommendations
Cites work
- Consecutive primes in tuples
- Dense clusters of primes in subsets
- scientific article; zbMATH DE number 4093588 (Why is no real title available?)
- scientific article; zbMATH DE number 3786910 (Why is no real title available?)
- scientific article; zbMATH DE number 3467229 (Why is no real title available?)
- scientific article; zbMATH DE number 2234904 (Why is no real title available?)
- scientific article; zbMATH DE number 3064221 (Why is no real title available?)
- Symmetric and asymmetric primes
- The distribution of integers with a divisor in a given interval
- The divisor function at consecutive integers
- Triangles with prime hypotenuse
- Variants of the Selberg sieve, and bounded intervals containing many primes
Cited in
(7)- Symmetric and asymmetric primes
- Small gaps between almost primes, the parity problem, and some conjectures of Erdős on consecutive integers II.
- Prime Desert n-Tuplets
- Existence of Symmetric Skew Balanced Starters for Odd Prime Powers
- On the symmetry graph of prime numbers
- E-symmetric numbers
- The multiplication table constant and sums of two squares
This page was built for publication: Symmetric primes revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5244182)
