ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For real xx and t>1t>1, let S⌊x/nt⌋,xS_{\left\lfloor x/n^t\right\rfloor,x} denote the set considered in the paper, with the function defining Sf,xS_{f,x} taken to be non-piecewise. Sparsity conjecture. The family of sets S⌊x/nt⌋,xS_{\left\lfloor x/n^t\right\rfloor,x} 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 tt 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 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.