ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let N(x;p)N(x;p) denote the number of prime chains beginning at the prime pp whose final-to-initial ratio is at most xx. Prime-chain counting conjecture. One has

N(x;p)≪x.N(x;p) \ll x.

The paper notes that this is easy to prove for bounded pp, while the general case would improve the effective upper bound established in the paper.

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.