Reproduce “Exact Prime Counting and Deterministic Prime Finding in Time N^o(1)” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Jiayan Ni

The authors give deterministic algorithms to compute the exact prime sum up to N, the prime count π(N), and a prime above N. They encode prime sums as arithmetic counting constraints and reduce the tasks to a subexponential counting engine, recovering exact answers by rounding. The bounds are N^{o(1)} in machine steps; polynomial-time-in-digits prime finding remains open.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.