ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Bn{\mathcal B}_n be the set of binary integers with nn binary digits, let a←\overleftarrow{a} denote the integer obtained by reversing the binary digits of aa, and let Θ(n)\varTheta(n) be the number of a∈Bna\in{\mathcal B}_n such that both aa and a←\overleftarrow{a} are prime. Asymptotic conjecture.

Θ(n)=(3+o(1))2n−1(log⁡2n)2(n→∞).\varTheta(n)=(3+o(1))\frac{2^{n-1}}{\left(\log 2^n\right)^2}\qquad(n\to\infty).

This heuristic prediction comes from treating primality of a binary integer and of its reversal as conditionally independent after accounting for the shared congruence obstruction modulo 33. The stated calculations agree with the prediction for all n⩽50n\leqslant 50; no proof of the asymptotic is supplied here.

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.