2008.01368
THE PRIME-POWER MAP
Steven , Jonathan Hoseana
correcthigh confidence
- Category
- Not specified
- Journal tier
- Specialist/Solid
- Processed
- Sep 28, 2025, 12:55 AM
- arXiv Links
- Abstract ↗PDF ↗
Audit review
The paper proves S(x) ≪ ln ln x via primes in short intervals (Hoheisel) to obtain P(x) ≤ x^θ for non–prime-powers beyond a threshold, then iterates a power-type contraction until a bounded terminal phase (Theorem 10). The candidate solution uses the same contraction idea, but invokes Baker–Harman–Pintz to ensure a prime in (t, t + t^θ], derives the same P(x) ≤ x^θ envelope, iterates it, and then bounds the small terminal phase. The logic, dependencies, and structure are essentially the same, differing only in the specific short-interval formulation and envelope notation. Both are correct; the model’s proof is a close variant of the paper’s argument.
Referee report (LaTeX)
\textbf{Recommendation:} minor revisions
\textbf{Journal Tier:} specialist/solid
\textbf{Justification:}
A careful and correct study of a natural analogue of Pillai’s prime map. The double-logarithmic bound for the settling time uses standard but nontrivial short-interval inputs, and the paper places this result within a broader and coherent dynamical framework, including density statements and a comparison family P\_p. The contribution is solid and well-presented, with modest room for clarifications regarding the short-interval variants and thresholds.