ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SS be a finite, non-empty set of prime numbers with an even number of elements, and let β~S\tilde{\beta}_S and β~\tilde{\beta} be as in Theorem 1. For x>0x>0, let β~S(x)\tilde{\beta}_S(x) denote the associated counting function βS(x)\beta_S(x), and define

L(x)=∫1xett dt.L(x)=\int_1^x\frac{e^t}{t}\,dt.

Class-number asymptotic conjecture. Under the conditions of Theorem 1, as x→∞x\to\infty one has

πS(x)=12L(4x)+O(e3xx).\pi_S(x)=\frac{1}{2}L(4x)+O\left(\frac{e^{3x}}{x}\right).

The paper proves the leading asymptotic πS(x)∼e4x/(2x)\pi_S(x)\sim e^{4x}/(2x) but explains that its method does not preserve the sharper error term available from the Prime Geodesic Theorem. This conjecture predicts an error of order e3x/xe^{3x}/x for the class-number counting function.

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.