Sparsity conjecture for sets satisfying the prime number theorem
Statement
For real and , let denote the set considered in the paper, with the function defining taken to be non-piecewise. Sparsity conjecture. The family of sets are the sparsest sets that satisfy the prime number theorem. The preceding asymptotic formula shows that these sets satisfy the prime number theorem, while their density becomes smaller as increases; the conjecture asserts optimality of this sparsity among such sets.
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.