Asymptotic conjecture for reversible binary prime pairs
Statement
Let be the set of binary integers with binary digits, let denote the integer obtained by reversing the binary digits of , and let be the number of such that both and are prime. Asymptotic conjecture.
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 . The stated calculations agree with the prediction for all ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.