The reverse Goldbach problem and a refined Zsiflaw--Legeis theorem

Abstract

We prove new results on the additive theory of reversed primes p; that is, primes p which are written backwards in a fixed base b≥ 2. In particular, we study a variant of Goldbach's conjecture, looking at representations of integers as the sum of primes and reversed primes. We show that: (1) Every large odd integer is the sum of a prime and two reversed primes (N=p1+p2+p3). (2) Every large odd integer is the sum of two primes and a reversed prime (N=p1+p2+p3). (3) Almost all even integers are the sum of a prime and a reversed prime (N=p1+p2). (4) All large integers are the sum of a reversed prime and a square-free number (N=p+η, μ2(η)=1). To obtain our results, along with associated asymptotics, we apply the Hardy--Littlewood circle method and a novel refinement of the ``Zsiflaw--Legeis" theorem on the distribution of reversed primes in arithmetic progressions. Notably, our variant of the Zsiflaw--Legeis theorem does not require one to fix the digit length unlike previous versions.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…