ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A267013(d)A267013(d) denote the number of non-primonumerophobic digit patterns of length dd, and let A164864(d)A164864(d) denote the total number of available digit patterns of length dd. Asymptotic ratio conjecture. As d→\ftyd\rightarrow\fty, the ratio of these sequences satisfies

A267013(d)A164864(d)∼9⋅9!dln⁡10.\frac{A267013(d)}{A164864(d)}\sim\frac{9\cdot9!}{d\ln 10}.

The preceding combinatorial estimate yields the same asymptotic expression heuristically, but the supplied source does not establish the corresponding asymptotic for the exact sequences.

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.