Asymptotic ratio of non-primonumerophobic and digit-pattern sequences
Statement
Let denote the number of non-primonumerophobic digit patterns of length , and let denote the total number of available digit patterns of length . Asymptotic ratio conjecture. As , the ratio of these sequences satisfies
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.