ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let rp0r_{p_0} be a ray with p0∈C‾p_0\in\overline{C}. Let ll denote the number of correct decimal digits available in the floating-point arithmetic, and let n∗(l)n^*(l) be a finite index. For odd m=2n∗(l)+1m=2n^*(l)+1, let p~mp0\tilde p_{mp_0} be the natural number predicted by formulae (34) and (35), and let xx be a solution of equation (36) whose right-hand side is p(m−1)p0p_{(m-1)p_0}. The prime number associated with the ray is denoted by pmp0p_{mp_0}. Finite-ray prediction accuracy hypothesis. For every ray rp0r_{p_0} with p0∈C‾p_0\in\overline{C}, there exist finite numbers ll and n∗(l)n^*(l) such that p~mp0\tilde p_{mp_0} lies closer to pmp0p_{mp_0} than xx does. This compares the proposed finite-domain approximation with the usual logarithmic-integral inversion; the source provides numerical motivation but no proof or resolution.

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.