REVIEW 2 cited by
On Telhcirid's theorem on arithmetic progressions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In this paper, we study the distribution of the digital reverses of prime numbers, which we call the "reversed primes". We prove the infinitude of reversed primes in any arithmetic progression satisfying straightforward necessary conditions provided the base is sufficiently large. We indeed prove an effective Siegel--Walfisz type result for reversed primes, which has a larger admissible level of modulus than the classical case.
Forward citations
Cited by 2 Pith papers
-
Prime numbers with an almost prime reverse
For every base b≥2, infinitely many primes have a reversed digit string with at most Ωb prime factors, with explicit Ωb given.
-
The Zsiflaw--Legeis theorem for arbitrary bases
The digital reverse of primes is equidistributed in arithmetic progressions for every base g>=2, with a quantitative error term.
Discussion (0). Continue with ORCID to comment.