ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let b≥2b\geq 2 be a fixed base. For a positive integer, write n←\overleftarrow{n} for its digit reversal in base bb. Then p1p_1 and p2p_2 are primes, and gcd⁡(p2←,b3−b)=1\gcd(\overleftarrow{p_2},b^3-b)=1. Hcabdlog's conjecture. Every sufficiently large even number NN can be expressed as

N=p1+p2←.N=p_1+\overleftarrow{p_2}.

This conjecture suggests that the exceptional set in the corresponding prime-plus-reversed-prime representation theorem should be Ob(1)O_b(1). The parity restriction is necessary because b3−bb^3-b is even, so the admissible reversed prime is odd. It is introduced as a simplified variant of a conjecture of Chourasiya and others.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.