The linear bound conjecture for prime-chain counts
Statement
Let denote the number of prime chains beginning at the prime whose final-to-initial ratio is at most . Prime-chain counting conjecture. One has
The paper notes that this is easy to prove for bounded , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.