arXiv Analytics

Sign in

arXiv:1908.06161 [math.NT]AbstractReferencesReviewsResources

Symmetric primes revisited

Carl Pomerance

Published 2019-08-16Version 1

A pair of odd primes is said to be symmetric if they are 1 modulo their difference. A theorem from 1996 by Fletcher, Lindgren, and the current author gets an upper bound for the distribution of primes that belong to a symmetric pair. In this paper that theorem is improved to what is likely to be a best possible result.

Comments: 3 pages
Categories: math.NT
Related articles: Most relevant | Search more
arXiv:1002.3357 [math.NT] (Published 2010-02-17, updated 2011-10-07)
Maximal ratio of coefficients of divisors and an upper bound for height for rational maps
arXiv:1404.3296 [math.NT] (Published 2014-04-12)
Large Even Number Represent The Sum Of Odd Primes
arXiv:0909.3107 [math.NT] (Published 2009-09-16)
An upper bound for the height for regular affine automorphisms of A^n