ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let the sequence of primes be ordered by increasing value, and call a prime cryptarithmically unique when no other prime has the same multiset of decimal digits. A sequence is asymptotically cryptarithmically unique if the proportion of its terms that are cryptarithmically unique tends to 11. Asymptotic cryptarithmic-uniqueness conjecture. The sequence of primes is asymptotically cryptarithmically unique. The preceding estimates predict that the density of cryptarithmically unique primes eventually approaches unity, but the supplied source gives no proof of this asymptotic assertion.

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.