{"id":"097037d8-5606-49c7-85ed-dcda95980622","arxiv_id":"2505.04951","paper_version":3,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For the averaged-prime sequence, analogues of the Cramer, Andrica, Legendre, Oppermann, Brocard, Firoozbakht, Fourges, Nicholson, and Farhadian conjectures are proved from known explicit estimates.","lead":"This paper proves that several famous unsolved conjectures about prime gaps become provable theorems when applied to the running average of the first n primes. A smart generalist might read it to see how averaging smooths a famously irregular sequence, even though it does not settle the original conjectures.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The proof of the key lower bound \\bar g_n > (ln n)/2 is invalid as written: Eq (30) miscomputes the algebra and cannot imply the bound for n>e^4. A corrected proof using Hassani's bound seems to work, but the paper as written leaves a gap.","rationale":"The paper's central claim is that the averaged-prime gaps satisfy \\bar g_n=\\Theta(\\ln n), specifically (\\ln n)/2<\\bar g_n<\\ln n, and that this makes averaged-prime analogues of several famous conjectures theorems. The upper bound appears to be supported by the algebra in Eqs (26)-(29) and the explicit check for n\\ge3. The lower bound, however, is not supported by the displayed proof in Eq (30). The written chain contains a false algebraic identity, and even the natural corrected numerator gives a bound below \\ln n/2 for all n>e^4. Since the lower bound is part of the central theorem and is used in the Brocard analogue, this is the most load-bearing weak point in the argument. I am not claiming the theorem is false: the lower bound appears to be true in numerical tests and can likely be proved by combining Eq (6) with p_n>n\\ln n, but that corrected argument is absent, so the paper as written leaves a proof gap. The reader's verdict of CONDITIONAL is appropriate, and my concern does not move the verdict; it reinforces the need for the requested correction and documentation of finite checks. I marked agreement_with_reader as 'partial' because the reader's stated weakest assumption was external explicit estimates and unlisted finite computations, whereas I judge the internal algebraic error in Eq (30) to be the more immediate obstruction; the reader did note Eq (30) in their rationale, so there is substantial overlap. No ad hominem or theatrical framing is intended; the issue is purely technical and repairable.","tokens_in":9846,"tokens_out":20551,"duration_ms":193215,"concrete_test":"Re-derive Eq (30) line by line and verify the algebraic identity. Specifically: (a) compute the right-hand side \\frac{\\ln n}{2}\\frac{1+4/\\ln n}{1+1/n} and compare it with \\frac{n\\ln n/2+4}{n+1}; (b) evaluate \\bar g_n exactly for n=55, 100, and 1000 using a prime table or a short script, and compare with \\ln n/2 to see whether the claimed lower bound holds numerically; (c) replace the Mandl upper bound by Hassani's bound in Eq (6) and check the corrected inequality \\frac{n\\ln n/2+2+n/14}{n+1}>\\frac{\\ln n}{2} for all n\\ge10, together with an explicit table or code for n=1..9. If (c) succeeds and (b) is consistent, the central theorem survives with a corrected proof; if (b) fails at any tested n, then Eq (32) and the Brocard analogue are false.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section 4's central gap estimate (32) contains the lower bound \\bar g_n > \\ln n/2 for n\\ge 1. The displayed derivation in Eq (30) does not prove it. The paper writes\n\\bar g_n > \\frac{n\\ln n/2+4}{n+1} = \\frac{\\ln n}{2}\\frac{1+4/\\ln n}{1+1/n}.\nThe equality is false: the right-hand side equals \\frac{n\\ln n/2+2n}{n+1}, not \\frac{n\\ln n/2+4}{n+1}. If the intended numerator was the natural estimate \\frac12p_n+2, coming from p_{n+1}\\ge p_n+2 and \\bar p_n<p_n/2, then the resulting lower bound is\n\\frac{n\\ln n/2+2}{n+1}, whose difference from \\ln n/2 is \\frac{2-\\ln n/2}{n+1}, which is negative for n>e^4\\approx54.6. Thus the chain in Eq (30) cannot establish the global lower bound asserted in Eq (31) and displayed in Eq (32). This is load-bearing because Eq (32) is the paper's central theorem, and the Brocard analogue uses the lower bound in Eq (65): \\bar\\pi(\\bar p_{n+1}^2)-\\bar\\pi(\\bar p_n^2)>\\ln n, which follows only from \\bar g_n>\\ln n/2. A repair is available: for n\\ge10, Eq (6) gives \\bar p_n<p_n/2-n/14, so p_{n+1}-\\bar p_n>p_n/2+2+n/14>n\\ln n/2+2+n/14, and\n\\frac{n\\ln n/2+2+n/14}{n+1}-\\frac{\\ln n}{2}=\\frac{2+n/14-\\ln n/2}{n+1}>0\nfor all n\\ge10 (the numerator is increasing for n>7 and positive at n=10). The cases n=1..9 must be checked explicitly. This corrected proof is not what the paper supplies; the displayed proof is therefore incomplete, even though the final inequality may be true.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper defines the arithmetic average of the first n primes, \\bar p_n = (1/n)\\sum_{i=1}^n p_i, and the associated counting function \\bar\\pi(x) = \\#\\{i : \\bar p_i \\le x\\}. The main technical result is a pair of bounds on the averaged-prime gaps \\bar g_n = \\bar p_{n+1}-\\bar p_n: the paper claims \\bar g_n < \\ln n for n\\ge 3 and \\bar g_n > (\\ln n)/2 for n\\ge 1, which imply \\bar g_n/\\bar p_n is bounded by constants over n. Using these bounds and explicit estimates of Rosser--Schoenfeld, Mandl, Dusart, and Hassani, the paper derives averaged-prime analogues of the Cramer, Andrica, Legendre, Oppermann, Brocard, Firoozbakht, Fourges, Nicholson, and Farhadian conjectures, showing that these analogues are theorems rather than conjectures. The closing discussion notes that the averaged results do not transfer directly to the ordinary primes.","tokens_in":10339,"tokens_out":39296,"duration_ms":336607,"significance":"If the proof gaps identified below are repaired, the paper makes a clean and useful observation: averaging the primes smooths out local fluctuations so strongly that several classical conjectural gap and spacing statements become provable theorems for the averaged sequence. A particular strength is the explicit use of published estimates, which makes the argument largely quantitative and leaves only finite checks to be documented. The central idea—that the invertible transformation p_n \\leftrightarrow \\bar p_n can convert conjectures into theorems after averaging—is novel and of interest to number theorists, even though the paper correctly cautions that the averaged results do not resolve the original conjectures.","major_comments":[{"comment":"The displayed chain contains an algebra error: from p_{n+1} \\ge p_n+2 and \\bar p_n < p_n/2 one obtains \\bar g_n > (p_n/2+2)/(n+1), not (p_n/2+4)/(n+1). Using p_n>n\\ln n then gives \\bar g_n > (n\\ln n/2+2)/(n+1), whose difference from \\ln n/2 is (2-\\ln n/2)/(n+1), which is negative for n>e^4. Thus Eq. (31) and the lower bound in Eq. (32) are not proved as written. A repair exists: combining Eq. (6) with p_{n+1} \\ge p_n+2 yields \\bar g_n > (p_n/2+2+n/14)/(n+1) > (n\\ln n/2+2+n/14)/(n+1), which exceeds \\ln n/2 for n\\ge 10, with n\\le 9 checked separately. This correction must be made and the consequences for later sections, especially the Brocard analogue, re-verified.","section":"Sec. 4, Eq. (30)"},{"comment":"The step \"use prime-average analogue of Oppermann\" does not imply \\bar\\pi(\\bar p_{n+1}^2)-\\bar\\pi(\\bar p_n^2)>2\\bar g_n. The Oppermann analogue proved in Sec. 5.4 gives, for each real m\\ge 2, at least one averaged prime in (m^2,(m+1/2)^2) and in ((m-1/2)^2,m^2), but these local existence statements are not additive: a single averaged-prime value can lie in more than one such interval as m varies, so the number of distinct averaged primes in (\\bar p_n^2,\\bar p_{n+1}^2) is not bounded below by 2\\bar g_n through this argument. Consequently Eq. (65) and the derivation of Eqs. (66)-(67) are unsupported. The Brocard analogue is likely recoverable from a density estimate using \\bar g_k<\\ln k, but the manuscript must supply that argument.","section":"Sec. 5.5, Eqs. (64)-(65)"},{"comment":"The second inequality in Eq. (70) has the wrong direction. Since \\bar p_n < p_n/2 < (1/2)n\\ln(n\\ln n) = (1/2)n\\ln n(1+\\ln\\ln n/\\ln n), the quotient n\\ln n/\\bar p_n is larger than 2/(1+\\ln\\ln n/\\ln n), not smaller. The displayed chain therefore cannot yield Q<2-\\ln\\bar p_n. The intended conclusion follows instead from the already-proved bound \\bar g_n/\\bar p_n<2/n (Eq. (36)), which gives n\\bar g_n/\\bar p_n<2. Please correct the derivation and re-check the small-n verification for n=1,...,11.","section":"Sec. 5.6, Eq. (70)"}],"minor_comments":[{"comment":"The claimed analytic thresholds are numerically false: \\ln((n/2)\\ln(n/2))>2 first holds at n=10, not n=5, and \\ln(p_n/(2\\ln p_n)\\ln(n/2))>2 first holds at n=11, not n=5. The final statements n\\ge 6 and n\\ge 7 appear to be supported by the explicit checks, but the incorrect thresholds should be removed or corrected.","section":"Secs. 5.8 and 5.9, Eqs. (81) and (87)"},{"comment":"The proofs repeatedly rely on unlisted finite computations phrased as \"explicitly checking smaller integers\", \"smaller values of x\", and \"the first 55 average primes\". These checks should be made reproducible by stating the exact ranges and either tabulating the results or providing the verification code.","section":"Sections 2-5, finite checks"},{"comment":"The phrase \"for integer n\\ge 3 corresponding to m\\ge\\sqrt 5\" is inaccurate: \\bar\\pi(m^2)\\ge 3 first occurs when m^2\\ge \\bar p_3=10/3, i.e. m\\ge\\sqrt{10/3}. The subsequent argument is not affected, but the statement should be corrected.","section":"Sec. 5.4"},{"comment":"There is a typo in the introduction: \"we shall soon se\" should be \"we shall soon see\".","section":"Introduction"}],"recommendation":"major_revision","confidential_remarks":"The manuscript header states that this work is already published in Mathematics 13 (2025) 2279. If this submission is intended for a new venue, the editor should take into account the prior publication and the fact that the uncorrected errors in Eq. (30), Eqs. (64)-(65), and Eq. (70) are present in the published version."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nYou should know two things about this paper. First, the main theorem — that averaged-prime analogues of Cramer, Andrica, Legendre, Oppermann, Brocard, Firoozbakht, Nicholson, and Farhadian are all provable — is true, and the key bound \\bar g_n = Θ(ln n) is the right way to see it. Second, the proof of the lower half of that bound as printed is wrong: Eq (30) contains an algebra slip, so the displayed derivation of \\bar g_n > (ln n)/2 for all n ≥ 1 does not go through. The stress-test note is correct on this. A repair exists using Hassani's stronger Mandl inequality (\\bar p_n < p_n/2 − n/14 for n ≥ 10), which gives the bound for n ≥ 10, with small n checked separately. So the result is salvageable and almost certainly true, but the paper as written has a gap in its central estimate.\n\nWhat is genuinely new: the averaged sequence \\bar p_n is smooth enough that all these famous conjectures become theorems, and the gap bound \\bar g_n = Θ(ln n) is the engine. Section 6 is honest that this does not transfer back to the original prime gaps; naive inversion only gives g_n = O(n ln n). That is the right thing to say, and it keeps the paper from overclaiming.\n\nThe soft spots: besides Eq (30), Eq (87) claims an inequality holds for n ≥ 5 that actually fails for n = 5..10 (though the final domain n ≥ 7 is verified by a finite check). The paper repeatedly says 'explicitly checking smaller integers' without showing the table, which is annoying for reproducibility but minor. The proofs are short consequences of Rosser–Schoenfeld, Dusart, Mandl, and Hassani; no free parameters, no circularity. The analogues are somewhat ad hoc — the author admits the main difficulty is designing them — but that is a feature, not a flaw.\n\nThis is a paper for people who like clean smoothing arguments and want to see how averaging tames prime gaps. It is not a breakthrough about the primes themselves, and the author does not pretend it is. With the two errors fixed and the finite checks documented, it would be a solid contribution.\n\nMy call: send it to peer review if it comes your way, but require the corrections. I would not desk-reject it; the central observation is valid and the exposition is mostly clear. I won't be citing it in my own work unless I work on averaged prime sequences, but it deserves a serious referee.\n\nBest,","headline":"True and repairable, but the printed proof of the central lower bound has a real algebra error.","tokens_in":10897,"tokens_out":3481,"would_cite":false,"duration_ms":31711,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["11N05","11A41"],"pacs":[],"model":"deepseek-v4-flash","headline":"The arithmetic average of the first $n$ primes has gaps between $(\\ln n)/2$ and $\\ln n$, so suitably formulated prime-averaged analogues of nine classic conjectures are provable theorems, not conjectures.","keywords":["nth prime","average of first n primes","prime gaps","prime-averaged conjectures","Cramer conjecture","Andrica conjecture","smoothing","explicit estimates"],"falsifier":"Compute $\\bar p_n = (\\text{sum of first }n\\text{ primes})/n$ exactly and compare $\\bar g_n = \\bar p_{n+1}-\\bar p_n$ with $\\ln n$. A single verified case with $n\\ge 3$ where $\\bar g_n\\ge\\ln n$, or $n\\ge 1$ where $\\bar g_n\\le(\\ln n)/2$, would refute the central bound; scanning up to a large computable range, say $n=10^6$, is a direct test, and a violation of the stated ratio window $0.7/n<\\bar g_n/\\bar p_n<2/n$ for $n\\ge 4$ would also falsify the claim.","tokens_in":9615,"feed_emoji":"🔢","tokens_out":7730,"duration_ms":70749,"temperature":0.7,"pith_summary":"This paper studies $\\bar p_n$, the average of the first $n$ primes, and proves that its successive gaps are tiny: $(\\ln n)/2 < \\bar g_n < \\ln n$ for $n\\ge 3$. Because the gaps are so small, the averaged sequence satisfies prime-averaged analogues of the Cramer, Andrica, Legendre, Oppermann, Brocard, Fourges, Firoozbakht, Nicholson, and Farhadian conjectures, and these analogues are theorems rather than conjectures. The paper also notes that although $\\bar p_n$ and $p_n$ carry identical information through the inversion $p_n = n\\bar p_n - (n-1)\\bar p_{n-1}$, the averaging process smooths away the wild local fluctuations of ordinary primes. The original conjectures for ordinary primes remain untouched: the link between ordinary and averaged gaps is too weak to transfer the new bounds back.","feed_headline":"Averaging the first n primes turns nine conjectures into theorems","feed_subtitle":"The gap between averaged primes is below ln n, so analogues of nine famous conjectures become provable facts.","key_machinery":"The central object is the averaging map $\\bar p_n = \\frac{1}{n}\\sum_{i=1}^n p_i$, together with the derived gap bound $(\\ln n)/2 < \\bar g_n < \\ln n$. The map turns the $n$th prime into an arithmetic mean, and its key property is smoothing: although $\\bar p_n \\sim p_n/2$ asymptotically, the averaged gaps shrink like $\\ln n$ in absolute terms and like $2/n$ relative to $\\bar p_n$, whereas ordinary prime gaps are highly irregular. All the averaged-prime theorems follow from this gap bound combined with explicit inequalities for $p_n$, $\\bar p_n$, and $\\pi(x)$; the only recurring difficulty is designing convincing analogues of each original conjecture.","core_discovery":"The paper's central claim is that the averaged-prime gap $\\bar g_n = \\bar p_{n+1} - \\bar p_n$ satisfies $(\\ln n)/2 < \\bar g_n < \\ln n$ for $n\\ge 3$, and consequently $\\bar g_n/\\bar p_n$ is bounded between roughly $0.7/n$ and $2/n$ for $n\\ge 4$. This extremely fast relative decay is the mechanism that lets the author prove averaged-prime analogues of the Cramer, Andrica, Legendre, Oppermann, Brocard, Fourges, Firoozbakht, Nicholson, and Farhadian conjectures. The proof combines standard explicit estimates for primes and prime-counting functions with finite checks below explicit thresholds: upper bounds on $p_n$, lower bounds on $\\bar p_n$, the inequality $\\bar p_n < p_n/2$, and Dusart-type estimates for $\\pi(x)$. The author emphasizes that the result does not transfer back to ordinary primes, since the exact identity relating $g_n$ to $\\bar g_n$ yields only $g_n = O(n\\ln n)$.","pith_inferences":["This suggests a testable general principle: a monotone sequence whose gaps are $O(\\ln n)$ with relative gaps $O(1/n)$ will satisfy analogues of these conjectures; one could probe the idea by averaging other sparse integer sequences, such as squarefree numbers or primes in arithmetic progressions.","The proof's finite checks (up to roughly $n=440$ and the first 55 averaged primes) could be independently re-verified with exact arithmetic, and the method would be strengthened if the bounds could be extended inductively from a computable threshold without case checking.","The failure of the back-transfer suggests the original prime conjectures are governed by local fluctuations that averaging removes; the averaged analogues are therefore best read as illustrations of smoothing rather than as evidence for the ordinary conjectures."],"forward_implications":["For $n\\ge 3$, $\\bar g_n < \\ln n$ implies the averaged-prime analogue of Cramer's conjecture, $\\bar g_n = O((\\ln \\bar p_n)^2)$, holds trivially.","The averaged-prime analogue of Andrica's conjecture holds, and in fact $\\sqrt{\\bar p_{n+1}} - \\sqrt{\\bar p_n} < \\sqrt{\\ln n/n}$ for $n\\ge 2$.","The averaged-prime analogue of Legendre's conjecture holds for real $m\\ge 1$: there is at least one averaged prime between consecutive squares, and for $m\\ge 1$ the count difference is at least $(2m-1)/(2\\ln(m+1))$.","The averaged-prime analogue of Firoozbakht's conjecture holds: $(\\bar p_n)^{1/n}$ is decreasing for all $n\\ge 1$, and the Fourges, Nicholson, and Farhadian analogues follow on their stated ranges.","These results apply only to the averaged sequence; the paper's inversion identity is too weak to prove any of the original conjectures for ordinary primes."],"supporting_citations":[{"why":"Gives the lower bound $p_n > n\\ln n$, used in the lower and relative gap estimates.","marker":"[10]"},{"why":"Its bound on $|\\vartheta(x)-x|$ is the basis for the key lemma $g_n < n$, which feeds the upper gap bound.","marker":"[11]"},{"why":"Supplies the bound $\\bar p_n > p_{\\lfloor n/2\\rfloor}$ and the asymptotic expansion used for counting averaged primes and relative gap bounds.","marker":"[2]"},{"why":"Gives Mandl's inequality $\\bar p_n < p_n/2$, used to show $\\bar p_n$ is increasing and to count averaged primes.","marker":"[7]"},{"why":"Gives the sharper Hassani bound $\\bar p_n < p_n/2 - n/14$, used in refined gap and ratio estimates.","marker":"[3]"},{"why":"Provides the upper and lower estimates for $\\pi(x)$ used for the averaged-prime counting function and the Legendre analogue.","marker":"[12]"},{"why":"Cited for the monotone decrease of $(\\bar p_n)^{1/n}$, which carries the Firoozbakht analogue.","marker":"[9]"}],"fun_headline_variants":["Averaging primes proves nine conjectures","Nine conjectures fall to prime averaging","Prime averages make nine conjectures theorems","Smoothing primes yields nine new theorems"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The entire proof depends on published explicit bounds for primes and prime-counting functions being correct in the ranges used, and on the listed finite checks for small $n$ being error-free; if any of those fail, the gap bounds and every averaged analogue could fail.","fun_headline_variants_meta":{"raw":{"variants":["Averaging primes proves nine conjectures","Nine conjectures fall to prime averaging","Prime averages make nine conjectures theorems","Smoothing primes yields nine new theorems"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000198,"raw_usage":{"total_tokens":1406,"prompt_tokens":1024,"completion_tokens":382,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":640,"completion_tokens_details":{"reasoning_tokens":329}},"tokens_in":640,"tokens_out":382,"duration_ms":3894,"temperature":1.0,"reasoning_tokens":329,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T23:18:41.307018+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute $\\bar p_n = (\\text{sum of first }n\\text{ primes})/n$ exactly and compare $\\bar g_n = \\bar p_{n+1}-\\bar p_n$ with $\\ln n$. A single verified case with $n\\ge 3$ where $\\bar g_n\\ge\\ln n$, or $n\\ge 1$ where $\\bar g_n\\le(\\ln n)/2$, would refute the central bound; scanning up to a large computable range, say $n=10^6$, is a direct test, and a violation of the stated ratio window $0.7/n<\\bar g_n/\\bar p_n<2/n$ for $n\\ge 4$ would also falsify the claim.","supporting_citations":[{"cited_title":"Autour de la fonction qui compte le nombre de nombres premiers","cited_arxiv_id":null,"evidence_quote":"Supplies the bound $\\bar p_n > p_{\\lfloor n/2\\rfloor}$ and the asymptotic expansion used for counting averaged primes and relative gap bounds."},{"cited_title":"On the sum and the average of the first primes","cited_arxiv_id":null,"evidence_quote":"Gives Mandl's inequality $\\bar p_n < p_n/2$, used to show $\\bar p_n$ is increasing and to count averaged primes."},{"cited_title":"A Remark on the Mandl's Inequality","cited_arxiv_id":"math/0606765","evidence_quote":"Gives the sharper Hassani bound $\\bar p_n < p_n/2 - n/14$, used in refined gap and ratio estimates."},{"cited_title":"On a sequence involving sums of primes","cited_arxiv_id":null,"evidence_quote":"Cited for the monotone decrease of $(\\bar p_n)^{1/n}$, which carries the Firoozbakht analogue."}],"review_version":1}