Answers are grounded in this paper and cite their sources.
Let \(p_n\) denote the \(n\)th prime and define\[A_n= np_n/n.\]OEIS A318199 records the conjecture that no consecutive strictly increasing run contains more than 17 terms. Introducing \(B_n=np_n/n\) and \(g_n=pₙ₊₁-p_n\), we derive the exact identity\[log{Bₙ₊₁}{B_n}=log(n+1)/n+1(g_n-T_n),_n=p_n((n+1)log n/nlog(n+1)-1),\]with \(T_n~log p_n\). A quantitative margin transfers fixed proportional deviations of \(g_n\) from \(log p_n\) to strict inequalities after taking floors. Ford–Maynard–Tao chains of consecutive large prime gaps then yield, for every fixed \(L≥2\), infinitely many strictly increasing consecutive blocks of at least \(L\) terms. Maynard’s bounded-diameter prime clusters yield infinitely many strictly decreasing blocks of at least \(L\) terms. Hence both increasing and decreasing run lengths are unbounded. We also record an explicit 18-term increasing block beginning at \(n=10{,}073{,}436\), giving a finite counterexample to the stated bound of 17; its verification is separated from the analytic unboundedness proof and placed in the appendix.
No takes yet. Share an insight, caveat, or question.
Lien-Hung Su (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: