=================================================================== --- a/paper/kk-lower-bound.md version 6 +++ b/paper/kk-lower-bound.md version 7 @@ -1,668 +1,737 @@ -# A two-class Erdos and Rankin lower bound for the Jacobsthal gap +# A two-class Erdős–Rankin lower bound from finite estimates -**Contributions to the 27 September revisions:** [Benjaminsen](https://solveathome.org/@Benjaminsen) -provided direction and publication authorization. Codex (AI assistant; exact -model variant not recorded) performed the meta-research, source checks and -edits in these two tasks. Original mathematical sources and earlier project -contributors retain their credit; the [contribution record](../research/RESEARCH-CONTRIBUTIONS-2026-09-27.md) -names the recorded accounts, AI models and revision links. This is not a -claim of sole research authorship by the publishing account. +**Local exposition for manuscript-binding review, 8 October 2026.** -**Project direction and publication:** Chris Benjaminsen. Research and writing: see the contribution record above. +Chris Benjaminsen provided project direction. The three-band construction follows the architecture of Kalmynin and Konyagin and its existing fixed-offset adaptation in the project record. Earlier mathematical sources and contributors retain their credit. This new exposition was prepared by the actual gpt-6.1-sol assistant at high reasoning effort from the frozen Lean sources. It makes no claim to sole authorship or novelty. The original manuscript is preserved byte for byte in `original-manuscript-verbatim.md`. -**Status:** Draft for project review, 18 September 2026. This manuscript -implements the proposal `kk-lower-bound`. Its main composition is -**DERIVED / INFERRED, not independently refereed**, in the terminology of the -project's proposal registry. It is not a journal or arXiv submission and does -not lift the publication moratorium recorded in `paper/PAPERS.md`. - ## Abstract -This argument proves no assertion about the infinitude of twin primes. It -constructs long intervals without integers that survive the two residue -exclusions modulo every prime up to a given threshold. Write -$P(y)=\prod_{p\leq y}p$, and let $G_2(P(y))$ be the largest gap between -successive integers $n$ satisfying $\gcd(n(n+2),P(y))=1$. We give the -project's derivation of +Let $P(y)=\prod_{p\le y}p$, where the product includes every prime at or below the real cutoff $y$. The integers surviving the two exclusions are + $$ - G_2(P(y))\gg - \frac{y(\log y)^3(\log\log\log y)^2}{(\log\log y)^4}. - \tag{1} +\mathcal T_y=\{n\in\mathbb Z:\gcd(n(n+2),P(y))=1\}. $$ -The argument adapts the three-band construction of Kalmynin and Konyagin, -rather than applying their polynomial theorem to a different object. -The imported analytic inputs are their upper-sieve Lemma 1, Mertens' -theorem, the prime number theorem, and the smooth-number estimate of -Hildebrand and Tenenbaum, Corollary 1.3. We state these dependencies where -they enter and prove the intervening covering and counting steps. -The source's 1974 sieve-theorem reference has not been checked at the printed -page in this work. No implied constant or numerical starting threshold is -certified. Equation (1) remains a project-derived, unrefereed composition -from the stated inputs. -## 1. Object, contribution and prior work +We explain the frozen formal proof that their largest consecutive gap satisfies -Let $$ - {\cal T}_y=\{n\in\mathbb Z:\gcd(n(n+2),P(y))=1\}. +G_2(P(y))\gg +\frac{y(\log y)^3(\log\log\log y)^2}{(\log\log y)^4} +\qquad(y\longrightarrow\infty). \tag{1} $$ -This set is periodic with period $P(y)$ and is nonempty: $-1$ belongs -to it. We define $G_2(P(y))$ as the largest distance between consecutive -members of this periodic set, including the gap across a period boundary. -A gap of length $G$ therefore contains $G-1$ excluded integers. -All logarithms in this note are natural. -The object predates the project's terminology. Under the translation -$t=n+1$, exclusion means $t\equiv1$ or $-1\pmod p$ for some prime -$p\leq y$. Consequently, at the $k$-th prime $p_k$, +The proof constructs a cover of a finite interval by pairs of residue classes, bounds its remaining indices, and assigns a different reserved prime to each remaining index. The estimates needed for this construction are proved at the fixed parameter $A=12$. A finite Selberg sieve, a shifted finite Euler product, and an elementary factorial argument supply the three counting budgets. In particular, the final proof has no prime-number-theorem or smooth-number-asymptotic hypothesis. We also explain why the finite natural-number definition of $G_2$ is exactly the attained maximum over all integer starts, including negative starts and gaps crossing a period boundary. + +Seven stronger or more general claims printed in the original manuscript remain separate research obligations. Their original statements and domains are retained below. The mathematical exposition here is a new manuscript binding; evidence for the unchanged Lean objects does not by itself review this new text. + +## 1. The theorem and the integer gap it measures + +All logarithms are natural. For a finite set $S$ of primes, put $P_S=\prod_{p\in S}p$. An integer $s$ starts a consecutive survivor gap of distance $d\in\mathbb N$ when + $$ - G_2(P(p_k))-1=\mathrm{A144311}(k). - \tag{2} +d>0,\qquad s,s+d\in\mathcal T_S, +\qquad s+i\notin\mathcal T_S\quad(00$ and $Y$ such that, for every real $y\ge Y$, an attained largest integer survivor gap $d\in\mathbb N$ exists for $S=\{p\in\mathbb N:p\text{ prime},\ p\le y\}$, where the last comparison uses the real value of $p$, and + $$ - i(i+2)+b_p=0\pmod p. +c\frac{y(\log y)^3(\log\log\log y)^2}{(\log\log y)^4}\le d. $$ -When the two roots exist at an odd prime, they have centre $-1$ and -separation depending on $b_p$. Our excluded pair -$\{a_p,a_p-2\}$ has a moving centre and a fixed separation. Thus [KK, -Theorem 1] is not itself a theorem about $G_2$. Sections 4--7 below -adapt its proof architecture to this specific pair. -The project already records this adaptation in -`research/two-class-lower-bounds.md`, section 4c, and in the prior edition of -this manuscript (version 1, [R4]), sections 4--7 [R2, R4]. This draft supplies a -compact exposition, retains the later source corrections, and gives an -incidence-weight derivation of the residue-class sieve estimate directly -from [KK, Lemma 1]. It makes no claim to a new multi-class construction or -to priority for the two-class specialization. +“Largest” means both that some integer start realizes distance $d$ and that every consecutive survivor gap at every integer start has distance at most $d$. The primes in the theorem run up to $y$, even though an auxiliary counting sieve later runs only up to $\sqrt y$. -The source registry distinguishes this fixed-offset quantity from paired -Jacobsthal functions optimized over all even offsets and from systems with -two independently chosen classes per prime [R5]. Neither comparison -identifies these different extremal problems. +The formal statements are `PrimaryMain.manuscript_main_goal`, `IntegerMainBinding.integer_maximum_binding`, and `IntegerMainBinding.manuscript_integer_main_goal`. The first uses the finite definition of $G_2$; the second identifies that definition with the integer maximum for every finite prime family; the third combines the two into the literal integer formulation above. The prime-family condition in the second theorem specifies the object under discussion. It supplies no analytic estimate. -## 2. The exact covering identity +Here is the identification in detail. The polynomial $n(n+2)$ has the same residue at congruent integer arguments modulo $P_S$. Thus survivor membership is periodic, including at negative arguments. The residue $P_S-1$ survives: both $P_S-1$ and $P_S+1$ are coprime to $P_S$. This also covers the empty family, where $P_S=1$ and every integer survives. Every interval of $P_S$ consecutive positions contains a survivor, so any consecutive gap has distance at most $P_S$. -**Proposition 1 (elementary; [R2, section 1]).** The largest integer $m$ -for which one can cover $\{1,\ldots,m\}$ by pairs +The finite definition considers starts $0\le s0$, +The actual cover still has one pair at each prime. Formula (5) describes an auxiliary sieve, whose benefit is an additional factor from the middle band. Its local cardinality $g(p)$ is $1$ at $p=2$, $2$ at $p=3$, $4$ at middle-band primes, and $2$ at other primes at least $5$. A collision of the four middle-band residues would force a prime divisor of $1$, $2$ or $3$; the band lies above $3$, so no collision occurs. All local densities satisfy $0X$. -Since $D(n)\mid P(z)$, it is coprime to $P(z)$ exactly when -$D(n)=1$. Hence the left side of (7) is exactly $S(X,\Omega)$. -Applying Input S proves (11). $\square$ +The labels form a finite set and the weights are nonnegative cardinalities with total mass $X$. Every label divides the auxiliary squarefree prime product. For every divisor $d$ of that product, simultaneous local hits specify exactly $g(d)=\prod_{p\mid d}g(p)$ residue classes modulo $d$, by CRT. Each class has interval count differing from $X/d$ by at most $1$, even if $d>X$. Thus the actual weights satisfy -This is the conclusion of [KK, Corollary 1], expressed through counting -weights instead of its printed polynomial encoding. The source -record reports a representative and sign problem with that encoding -[R4, section 11.2; R6]. The proof above does not use it or an unstated -choice of integer representatives. The remaining imported obligation is -Input S itself. No Selberg support parameter or additional remainder sum -is introduced into (11). +$$ +\sum_{d\mid t}w_t=\frac{Xg(d)}d+r_d, +\qquad |r_d|\le g(d). \tag{8} +$$ -## 5. The three bands and the finite covering step +The sifted weight sum is exactly $S(X,\Omega)$. These identities are established for the counting weights, not supplied as unspecified sieve hypotheses. -Fix a constant $A>4$. A second constant $B>0$ will be chosen after -the sieve constant is accounted for. Write +Put $\nu(p)=g(p)/p$, extending multiplicatively on squarefree divisors, and $h(d)=\prod_{p\mid d}\nu(p)/(1-\nu(p))$. At a real level $H>1$, the Selberg denominator is + $$ - L=\log y,\qquad L_2=\log\log y,\qquad L_3=\log\log\log y, +J(H)=\sum_{\substack{d\mid P_{\mathrm{aux}}\\d^2\le H}}h(d). $$ -and set + +The explicit coefficients are + $$ - z_0=L^A,\qquad - z_1=\exp\!\left(\frac{L L_3}{A L_2}\right),\qquad - m=\left\lfloor\frac{y}{B}\frac{L^3L_3^2}{L_2^4}\right\rfloor . - \tag{13} +\lambda_d=\nu(d)^{-1}J(H)^{-1}\mu(d) +\sum_{\substack{k\mid P_{\mathrm{aux}}\\d\mid k,\ k^2\le H}}h(k). $$ -These are the parameters of [KK, section 2], instantiated as in -[R2, section 4c; R4, section 4]. -For fixed $A,B$, all sufficiently large $y$ satisfy +They have $\lambda_1=1$, vanish outside $d^2\le H$, and their quadratic main term is exactly $1/J(H)$, by finite Möbius inversion and diagonalization. Expanding the square against (8) gives the bound by $X/J(H)$ plus the actual remainder sum. The construction uses the squared-level convention above throughout. + +The remainder is controlled coarsely but explicitly. One has $|\lambda_d|\le d$ on supported divisors. A squarefree $n$ has $3^{\omega(n)}$ ordered divisor pairs with least common multiple $n$. Their aggregate coefficient therefore has absolute value at most $n^2 3^{\omega(n)}$, while $g(n)\le4^{\omega(n)}$. Only $n\le H$ contributes. The factors at $2$ and $3$ give + $$ - 34$. -We assert eventual validity, not a certified numerical value of $y$. -Choose the covering classes as follows: +so the entire remainder is at most $4H^5$. -| Primes | Choice of $a_p$ | Pair excluded modulo $p$ | -|---|---|---| -| $p\leq z_0$ or $z_10$, $X\ge1$, and $Z\ge2$, the finite Rankin inequality is + $$ - \sum_{p\leq\sqrt y}\frac{g(p)}p - =2\log\log\sqrt y+ - 2(\log\log z_1-\log\log z_0)+O(1). - \tag{20} +\Psi(X,Z)\le X^\alpha +\prod_{p\le Z}(1-p^{-\alpha})^{-1}. \tag{12} $$ -The contribution of the middle band is additional to the basic -two-class contribution. Since $g(p)\leq4$ and the small primes are -handled separately, the quadratic and higher terms in the logarithm -of the product have bounded sum. It follows that + +Indeed, each smooth $1\le n\le X$ has $1\le X^\alpha n^{-\alpha}$. Its weighted finite sum embeds into the sum over positive integers factored entirely over the finite set of primes $p\le Z$. The latter is a product of convergent geometric series because each $p^{-\alpha}<1$. This is local convergence for a finite prime family; the all-natural series need not converge when $\alpha\le1$. The identification with the actual smooth count uses `Nat.smoothNumbersUpTo X (⌊Z⌋₊ + 1)`, preserving the inclusive condition $p\le Z$ despite that library's strict bound convention. + +Let $U=\log X/\log Z\ge1$, suppose $\log Z\ge1$ and $U\le\sqrt Z$, and set + $$ - V(\sqrt y)\asymp - \frac1{(\log\sqrt y)^2} - \left(\frac{\log z_0}{\log z_1}\right)^2 - \asymp - \frac{A^4 L_2^4}{L^4L_3^2}. - \tag{21} +\delta=\frac{\log U}{2\log Z},\qquad\alpha=1-\delta. $$ -These are comparisons up to constant factors, not identities with unit -constant. In particular, exponentiating an $O(1)$ in (20) does not -remove it. -Multiplying (21) by (13) gives +Then $0\le\delta\le1/4$, $\alpha>0$, and $p^\delta\le\sqrt U$ for every prime $p\le Z$. The shifted local ratio satisfies + $$ - S(m,\Omega)\ll \frac{A^4}{B}\frac{y}{L}. - \tag{22} +\frac{1-1/p}{1-p^{\delta-1}} +=1+\frac{p^\delta-1}{p-p^\delta} +\le\exp\!\left(\frac{4(p^\delta-1)}p\right). \tag{13} $$ -After fixing $A$, choose $B$ large enough that this term is at most -$y/(4L)$ for all sufficiently large $y$. We have not assigned a -numerical value to the sieve constant. -### 6.3 The smooth-number term +For this bound, $p^\delta\le\sqrt p\le3p/4$ makes the denominator positive and at least $p/4$; then $1+t\le e^t$ applies. The inequality $e^x-1\le xe^x$ gives -Set $X=m+2$, $Z=z_1$. Then $$ - \log X=L+O(L_2),\qquad - u=\frac{\log X}{\log Z}\sim\frac{A L_2}{L_3}. - \tag{23} +p^\delta-1\le\delta\log p\sqrt U. $$ -Both $u$ and $Z$ tend to infinity. For example, with -$\varepsilon=1/2$, the range condition $u\leq Z^{1-\varepsilon}$ -holds eventually, because -$\log u=O(L_3)$ whereas -$\log Z=L L_3/(A L_2)$. -Moreover $u\log u=(A+o(1))L_2$. Input H therefore implies +Summing (13)'s exponent with (9), and using $2+\log Z\le3\log Z$, bounds the total shift cost by $6\log4\sqrt U\log U$. Combining the product with the ordinary inverse bound and + $$ - \Psi(m+2,z_1) - =(m+2)L^{-A+o(1)} - =o(y/L)\qquad(A>4). - \tag{24} +X^{1-\delta}=X\exp(-U\log U/2) $$ -For the last step, the ratio to $y/L$ is bounded by a constant times -$L^{4-A+o(1)}L_3^2/L_2^4$, which tends to zero. -This discharges the smooth-number range rather than assuming that a -fixed-$u$ estimate applies while $u$ grows. -Also $\sqrt y=o(y/L)$. Combining (17), (22) and (24), for sufficiently -large $y$, +proves + $$ - R\leq\frac{y}{3L}. - \tag{25} +\Psi(X,Z)\le CX\log Z +\exp\!\left(-\tfrac12U\log U+6\log4\sqrt U\log U\right). \tag{14} $$ -## 7. Completing the cover +Now use the actual $X=m+2,Z=z_1,U=u$. The proved parameter estimates give $X\le2yL^3$, $\log Z\le L$, and eventually $1\le u\le\sqrt Z$, $Z\ge e$. They also give the quantified limits -By Input P, the reserved interval $[y/2,y]$ contains more than -$y/(3L)$ primes for all sufficiently large $y$. Assign distinct -reserved primes $p_i$ to the $R$ remaining indices. Set -$a_{p_i}=i\pmod{p_i}$. This covers index $i$; covering other indices -as well causes no difficulty. Choose any value for unused reserved -primes. +$$ +\frac{\log X}{L}\longrightarrow1,\qquad +\frac{\log u}{L_3}\longrightarrow1,\qquad +\frac{u\log u}{L_2}\longrightarrow12, +$$ -All indices $1,\ldots,m$ are now covered by admissible pairs. -Proposition 1 gives +and $u\longrightarrow\infty$. For clarity, these limits can be read directly from quantitative identities. Put $r=\log X/L$. The floor and mass estimates give $1\le r\le1+7/\sqrt L\le2$, and + $$ - G_2(P(y))\geq m+1. - \tag{26} +u=r\frac{12L_2}{L_3},\qquad +\log u=L_3+\log12-\log L_3+\log r. $$ -With one fixed $A>4$ and the corresponding fixed $B$ from section 6, -equation (26) proves (1) from Inputs S, M, H and P. -**Calibration of (1).** The proof of the reduction is displayed here. -Its analytic inputs are cited published statements. The specialization -is the existing project-derived, unrefereed claim [R2, R4, R6], not a -new theorem asserted to have passed external review. The implied -constant depends on the fixed choices made in this proof; we do not -claim a lower-bound constant uniform over arbitrary $A,B$. +The bound $\log t\le2\sqrt t$ makes both $r-1$ and $(\log u)/L_3-1$ arbitrarily small at explicit sufficiently large thresholds. Their product gives $(u\log u)/L_2\to12$. Moreover $u\ge\sqrt{L_2}$ proves its growth. The same parameter estimates give $u\le48L_2$ and $\log Z\ge\sqrt L/48$; at the chosen larger threshold, a quadratic exponential bound implies $48L_2\le\sqrt Z$. Thus the range in (14) is proved for these exact parameters. These are parameter limits, not estimates for the number of smooth integers. -## 8. A shorter, weaker deduction +Take the eventual error tolerance $1/2$, so $u\log u\ge(23/2)L_2$, and enlarge the threshold until $\sqrt u\ge288\log4$. Then the positive shift term in (14) is at most $u\log u/48$. Its total exponent is therefore at most -The same covering identity and sieve input also give $$ - G_2(P(y))\gg y\log y. - \tag{27} +-\frac{23}{48}u\log u\le-\frac{529}{96}L_2\le-\frac{11}{2}L_2. $$ -This is Theorem A of version 1 [R4, section 9]. -For completeness, let $m=\lfloor c y\log y\rfloor$ and -$z=\sqrt m$, with $c>0$ fixed and sufficiently small. -Choose $a_p=0$ for $p\leq z$. -Lemma 2 with $\kappa=2$, together with Mertens' theorem, bounds the -uncovered indices by +The factor $X\log Z\le2yL^4$ and $\exp(-11L_2/2)=L^{-11/2}$ give + $$ - C\,\frac{m}{(\log z)^2} - \leq (4Cc+o(1))\,\frac{y}{\log y}. - \tag{28} +\Psi(m+2,z_1)\le\frac{2Cy}{L\sqrt L}. $$ -Here the constant $C$ absorbs the convergent local factors, including -the prime 2. Since $z=o(y)$, the number of unused primes is -$\pi(y)-\pi(z)\sim y/\log y$. Choosing $c<1/(8C)$ leaves more -than one unused prime per survivor, so the assignment in section 7 -finishes the cover. -If that constant is priced at all, the cited form gives -$C=2C_2e^{-2\gamma}C_1=0.41621\,C_1$ with $C_1(1/2)=805.5$ -($\delta=0.05$, $K=3$), so any $04$. -A lower-bound construction does not bound $G_2$ from above. In -particular, (1) is $y^{1+o(1)}=o(y^2)$, but that fact does **not** -show $G_2(P(y))=o(y^2)$. It also gives no claim about a prescribed -prime-sized interval containing a twin pair. No assertion in this note -changes the project's standing upper-bound problem. +## 7. Enough primes in the reserved interval -This draft uses the source record rather than reproducing the -historical quick draft unchanged: +We next prove the needed literal supply -| Item | Treatment in this manuscript | -|---|---| -| Finite cofactor inequality | Retains $2(m+2)/y\leq z_0$, including the additive 2 | -| Mertens product | Uses $\asymp$, retaining the unspecified constant factors | -| Parameter constants | Fixes $A$, then $B$; does not claim uniformity over arbitrary choices | -| Printed corollary encoding | Replaced here by the counting weights (12), with Input S explicit | -| Selberg remainder discussion | Not an input to the quoted Brun-form estimate; no claim that dimension 4 is a unique support threshold | -| Smooth-number source | Uses [HT, Corollary 1.3] with its growing-$u$ range checked | -| Numeric threshold | No certified $y_0$ is given; the historical $10^{134.1}$ calculation with constants set to 1 is not such a certificate | -| Computation | No published numerical experiment or ladder has been rerun, and no asymptotic claim is called computationally verified | +$$ +\#\{p\text{ prime}:y/2\le p\le y\}\ge\frac y{3\log y}. \tag{16} +$$ -The source record [R6] already explains why an earlier misattribution of -an explicit Mertens error does not change this asymptotic deduction. -Here no explicit Rosser--Schoenfeld or Dusart error formula is needed. -Likewise, the earlier finite tests of the covering step remain cited -historical evidence, not executions by this manuscript's preparer. +This is derived by a factorial argument. To avoid confusing smooth counts with prime-power counts, write $\psi(N)=\sum_{n\le N}\Lambda(n)$ and $\theta(N)=\sum_{p\le N}\log p$, where $\Lambda(p^j)=\log p$ for prime $p$ and $j\ge1$, and $\Lambda$ vanishes off positive prime powers. -The uniformity for these changing residue systems is settled under -Input S as quoted: its constant depends only on $\kappa$ (in the -Halberstam--Richert form as cited, on $\kappa,A_1,A_2$), and those -quantities are uniform here, because $g(p)\leq4$ and $g(p)/p\leq4/5$ -follow from (18) with $g$ integer-valued ($g(2)=1$, $g(3)=2$, and -$g(p)\leq4$ for $p\geq5$). The next mathematical review should check -Input S against a printed upper-sieve theorem and then inspect the -reduction in sections 4--7. -Tracking all constants would be a separate task. Optimizing the bands -or proving an optimal growth law is also left open. No additional -logarithmic factor is asserted on the basis of a heuristic multi-cover -argument. +Put $f(x)=x\log x-x$, with $f(0)=0$. Logarithmic ratio inequalities show, for positive integers $n$, -## 10. Source and search record +$$ +\log n\le f(n+1)-f(n)\le\log(n+1). +$$ -The following claim map separates proved elementary steps, imported -theorems and the unrefereed composition. +Induction gives, for $N\ge1$, -| Claim | Mathematical status | Traceable source | -|---|---|---| -| Covering identity and $G_2\geq g$ | Elementary proofs, section 2 | [R2, section 1]; [R4, section 2] | -| Bound (5) | Published one-class input plus elementary comparison | [KK, Theorem A and reference 1]; [R2, section 3] | -| Residue upper-sieve bound (11) | Elementary reduction conditional on the quoted Input S | [KK, Lemma 1 and Corollary 1, p. 4]; weights (12) | -| Three-band reduction and bound (1) | DERIVED / INFERRED, not refereed | [R2, section 4c]; [R4, sections 4--7]; [R6, section 3] | -| Smooth-number estimate and range | Published input, primary page inspected | [HT, Theorem 1.2 and Corollary 1.3, p. 417] | -| Weaker bound (27) | Derived from Input S, Mertens and PNT; not refereed | [R4, section 9] | -| Historical finite tests and source corrections | Reports of earlier project work only | [R4, sections 5 and 11]; [R6] | -| Absence of a twin-prime conclusion | Scope of the displayed argument | [R1]; sections 1 and 9 here | +$$ +N\log N-N+1\le\log(N!) +\le N\log N-N+1+\log N. +$$ -**Search update, 18 September 2026.** We reused -`research/SEARCH-CONVENTIONS.md`, sections 1, 3 and 5, and the relevant -source-review and closed-route entries of `research/OUTCOMES.md`. -The additional web search used the author names and identifier -`2302.00459`, and the phrases "paired or two-class Jacobsthal", -"forbidden residues 0 and -2", and "OEIS A144311". We inspected the -arXiv v2 source paper, the journal's Math-Net text, the current OEIS -entry, and the primary smooth-number page identified below. The -Ziller--Morack abstract was reached as an adjacent object; its full -paper was not re-audited in this assignment. +For $F(x)=\log(\lfloor x\rfloor!)$, this implies the uniform estimate -The search service incorrectly described [KK] as not journal-published. -The journal's own record and text resolve that point: it appeared in -*Izvestiya: Mathematics* in 2024. Search summaries are not used as -authority for the theorem or its bibliography. The inspected sources -do not themselves state this fixed-offset specialization as the -theorem under review. This bounded source comparison neither proves -novelty nor establishes the absence of other literature. +$$ +|F(x)-f(x)|\le1+\log(x+1)\quad(x\ge0). \tag{17} +$$ -The 1974 Halberstam--Richert pages were not accessed in this assignment. -We retain the source registry's documented access limitation rather -than repeating its failed retrievals or presenting OCR as a page reading. -The [FI] carrier recorded in section 3 sits at that same OCR custody and -is not a page reading either. No new citation-count claim is made. +For $x\ge1$, let $n=\lfloor x\rfloor$. Logarithmic ratio inequalities give $(x-n)\log n\le f(x)-f(n)\le(x-n)\log x$. Since $0\le x-n<1$, this difference lies between $0$ and $\log x$; combining it with the factorial bounds gives (17). The range $0\le x<1$ is handled separately, where the factorial is $0!=1$ and $-1\le f(x)\le0$. Thus applying (17) at $x/30$ does not require $x\ge30$. -### Primary references +Define the signed floor wheel and the factorial combination -- **[KK]** A. B. Kalmynin and S. V. Konyagin, *A polynomial analogue of - Jacobsthal function*, *Izvestiya: Mathematics* **88** (2) (2024), - 225--235, DOI [10.4213/im9467e](https://doi.org/10.4213/im9467e). - [arXiv:2302.00459v2](https://arxiv.org/abs/2302.00459v2), - section 2, especially Lemma 1 and Corollary 1 on p. 4 and the - three-band construction on pp. 5--7. - [Journal text](https://www.mathnet.ru/eng/im9467). - Retrieved arXiv PDF SHA-256: - `9dd8ce68421e50756ff7341a2320aaf65f240a9d98cca127d0525113e1613a79`. -- **[HT]** A. Hildebrand and G. Tenenbaum, *Integers without large prime - factors*, *Journal de Theorie des Nombres de Bordeaux* **5** (1993), - 411--484, Theorem 1.2 and Corollary 1.3, printed p. 417. - [Numdam](https://www.numdam.org/item/JTNB_1993__5_2_411_0/). - Retrieved PDF SHA-256: - `f7641a11188d783d8e941883467d541d71429b98d6760e7d20bf85cf53e80bac`. - The displayed formula and range were read from that page image, - because text extraction omitted the mathematical displays. -- **[HR]** H. Halberstam and H.-E. Richert, *Sieve Methods*, Academic - Press, 1974, Theorem 2.2, pp. 68--69 as identified in the project - source record. Cited through [KK]. Original printed pages not read - in this assignment. -- **[FI]** J. B. Friedlander and H. Iwaniec, *Opera de Cribro*, AMS - Colloquium Publications 57, 2010, Theorem 6.9 with Corollary 6.10, - pp. 68--69. Second carrier of the Theorem 2.2 statement used through - [KK]; reached at OCR custody in return #158 and re-read there, labeled - OCR rather than a page reading (section 10). Original printed pages - not read at page image in this assignment. -- **[O]** [OEIS A144311](https://oeis.org/A144311), definition and - attribution, revision 23 dated 5 December 2024, inspected - 18 September 2026. The current entry contains 22 values. They were - not recomputed or reproduced as a new dataset here. +$$ +w(n)=n-\lfloor n/2\rfloor-\lfloor n/3\rfloor +-\lfloor n/5\rfloor+\lfloor n/30\rfloor, +$$ -### Project sources and attribution +$$ +T(x)=F(x)-F(x/2)-F(x/3)-F(x/5)+F(x/30), +\qquad a=\frac7{15}\log2+\frac3{10}\log3+\frac16\log5. +$$ -These are the public editions served on 18 September 2026. References -identify the existing work from which the manuscript was prepared. +Adding $30$ changes the five terms in the wheel by $30,15,10,6,1$, whose signed combination is zero. Checking the thirty remainders therefore proves that the wheel takes only $0$ and $1$; it equals $1$ for $1\le n<6$. These are signed integer identities; truncated natural subtraction is not used. The exact combination of the five $f$-terms is $ax$, so (17) gives -- **[R1]** - [Proposal: a two-class Erdos--Rankin lower bound for G2](/projects/twin-primes/docs/paper/proposals/prop-kk-lower-bound.md), - sections 1--6, grade QUICK-DRAFT. - SHA-256 `6e87abcd4d72d22eee1612cbe1f78e65d335e3b2d00c42eb6145587459198670`. -- **[R2]** - [Two-class lower bounds](/projects/twin-primes/docs/research/two-class-lower-bounds.md), - sections 1, 3 and 4c. - SHA-256 `d4af9ec9c9923a51f1c8478d898d1de3a7bed4be566c55f4c63d3d1c856f2556`. -- **[R3]** - [Historical quick draft](/projects/twin-primes/docs/paper/proposals/draft-kk-lower-bound.md), - especially sections 3--5. Superseded finite inequality is not reused. - SHA-256 `d3de944c59a8c885c599e89b8ba9d3c23c027f0b587f6719c37e1cb14e6373c5`. -- **[R4]** - [A lower bound for the two-class Jacobsthal function](/files/7c375d9510a22b6fc2c6241eeffe51c1d92cb9daa17e4eba63220ed1c29c107f), - version 1 (the prior edition of this manuscript), sections 2--9 and - 11--12, pinned by content address so that the section references above - do not follow the served slug as it is revised. - SHA-256 `7c375d9510a22b6fc2c6241eeffe51c1d92cb9daa17e4eba63220ed1c29c107f`. -- **[R5]** - [Search conventions](/projects/twin-primes/docs/research/SEARCH-CONVENTIONS.md), - sections 1, 3 and 5. - SHA-256 `6160114056b5978f277959993d05a7693cc3c333bbe1becc57c4e3ed03db4b25`. -- **[R6]** - [Source review of Theorem 2c](/projects/twin-primes/docs/research/history/reviews-0907/11-two-class-theorem2c-source-review.md), - 8 September 2026, sections 0--3 and its source table. - SHA-256 `700031d9d550bb4d5067ec4691507585e4a149ed3d162b0e520e47318003fb43`. - The corresponding entry in - [OUTCOMES](/projects/twin-primes/docs/research/OUTCOMES.md) retains the - unread 1974 source page and unpriced constants. That edition has - SHA-256 `78c5ea9f7f96767696cdc0fed267fe06311c0ff723ab4ed15ef0c431343eb9e7`. -- **[R7]** - [Paper-suite architecture and authorship](/projects/twin-primes/docs/paper/PAPERS.md), - authorship and AI disclosure section, SHA-256 - `bd01edba6c84ac8681249c4c8cdc5e4cd845a73291406a2c38faa1cd56aeafc8`; - [mathematical style](/projects/twin-primes/docs/paper/writing-style-math.md). +$$ +|T(x)-ax|\le5(1+\log(x+1)). \tag{18} +$$ -## Methods and AI disclosure +The divisor identity $\sum_{d\mid n}\Lambda(d)=\log n$, followed by finite summation, gives -Chris Benjaminsen provided project framing, questions and publication -stewardship. Formal derivations, literature audits, computations and drafting -were performed by the AI workers and project contributors identified in the -[contribution record](../research/RESEARCH-CONTRIBUTIONS-2026-09-27.md). -The earlier accepted revision [#1093](https://solveathome.org/projects/twin-primes/return/1093) -was submitted under nielsegberts with model gpt-6-astra; the manuscript records -GitHub Copilot CLI as its tool. That revision's mathematical work consisted of -source inspection, exposition and checking the displayed deductions, not a -new numerical experiment. The 25 September correction -[#1730](https://solveathome.org/projects/twin-primes/return/1730) was submitted -under Benjaminsen with deepseek-v4-flash; the manuscript records Freebuff. -That correction changed the source-custody statements, the [R4] pointer, the priced -constant, the uniformity discussion and source-record wording. -The 27 September 2026 Codex meta-research revision, directed by Benjaminsen, corrects the -undefined constant and reversed numerical comparison in §8, updates the -source-record wording, and expands this disclosure (findings #2651–2653). -The 3 October 2026 correction (Codex Desktop, gpt-6.1-sol, high effort) -restores the attribution of the source-inspection description to revision #1093. -The specialized argument remains an adaptation of prior machinery, with -priority unestablished and the stated source/referee qualifications retained. -Earlier computations have their own cited code and -recorded outputs. Finite checks do not establish the asymptotic -argument. Refuted intermediate steps and the remaining source-access -and referee obligations are retained explicitly. +$$ +\log(N!)=\sum_{n\le N}\Lambda(n)\lfloor N/n\rfloor. +$$ + +Substituting it in the factorial combination yields the exact identity + +$$ +T(N)=\sum_{n\le N}\Lambda(n)w(\lfloor N/n\rfloor). +$$ + +Nonnegativity and the wheel properties now imply + +$$ +0\le T(N)\le\psi(N),\qquad +\psi(N)-\psi(\lfloor N/6\rfloor)\le T(N). \tag{19} +$$ + +With $L_N=1+\log(N+1)$, strong induction proves + +$$ +aN-5L_N\le\psi(N) +\le\frac65aN+5L_N^2. \tag{20} +$$ + +For the upper bound at $N\ge6$, take $M=\lfloor N/6\rfloor$. The induction hypothesis and (19) bound $\psi(N)$ by $aN+5L_N+(6/5)aM+5L_M^2$. Since $M\le N/6$, the linear terms are at most $(6/5)aN$. Also $N+1\ge3(M+1)$ and $\log3\ge1$, so $L_M+1\le L_N$. Hence $L_N^2-L_M^2\ge L_N$, absorbing the new error. For $N<6$, the elementary bound $\psi(N)\le N\log(N+1)$ handles the base case. + +The higher-prime-power tail satisfies, for $N\ge2$, + +$$ +0\le\psi(N)-\theta(N)\le2\sqrt N(\log N)^2. \tag{21} +$$ + +Indeed, every nonprime prime power $n\le N$ is $p^j$ with $p\le\lfloor\sqrt N\rfloor$ and $2\le j\le\lfloor\log N/\log2\rfloor$. This finite set lies in the image of those base-exponent pairs. Its size is at most the number of pairs, without needing an injectivity assertion. Each summand is at most $\log N$, and $\log2\ge2/3$ gives the stated loose coefficient $2$. + +The constants needed for a positive dyadic margin are proved rationally. The inequalities $(24/23)^{16}\le2$, $(12/11)^{12}\le3$, and $(8/7)^{12}\le5$, together with $\log r\ge1-r^{-1}$, give + +$$ +\log2\ge2/3,\qquad\log3\ge1,\qquad\log5\ge3/2, +\qquad a\ge31/36. +$$ + +Also $a\le2$ follows from $\log t\le t-1$ at $2,3,5$. + +For real $y\ge4$, use $N=\lfloor y\rfloor$, $M=\lfloor y/2\rfloor$. Combining (20) and (21), with $N\ge y-1$ and $M\le y/2$, proves + +$$ +\theta(y)-\theta(y/2)\ge\frac{2a}{5}y-\mathcal E(y), +$$ + +$$ +\mathcal E(y)=a+5L_++5L_+^2+2\sqrt y(\log y)^2, +\qquad L_+=1+\log(y+1). +$$ + +There is a concrete error threshold. If $y\ge300000^4$ and $\log y\ge1$, put $s=\sqrt{\sqrt y}\ge300000$. Then $y=s^4$, $\sqrt y=s^2$, and $\log y=4\log s\le8\sqrt s$. Therefore $(\log y)^2\le64s$, $L_+\le10s$, and $L_+^2\le576s$. It follows that + +$$ +\mathcal E(y)\le128s^3+2932s\le3060s^3\le y/90. +$$ + +The last inequality uses $90\cdot3060=275400\le s$. Since $2a/5\ge31/90$, the difference of theta sums is at least $y/3$. + +This difference sums $\log p$ over the strict interval $y/20$, with the fixed $B$ of Section 5. On the positive large domain the floor mass in (3) equals $c\cdot yL^3L_3^2/L_2^4$. The elementary floor inequality gives + +$$ +c\frac{yL^3L_3^2}{L_2^4} **Input M.** Mertens' prime harmonic estimate is +> $$ +> \sum_{p\leq t}\frac1p=\log\log t+M+o(1). +> \tag{8} +> $$ +> We need only bounded errors and differences of this estimate, not a +> numerically explicit error term. Its use is recorded in [R4, section 6.3] +> and in [KK, section 2]. + +### O2. OPEN — Uniform smooth-number asymptotic (original Eq. 9) + +The two-variable uniform equality for every fixed positive epsilon, with Z and u both tending to infinity, remains open in this package. The finite upper bound in Section 6 is sufficient at A=12 and has a weaker decay exponent. + + +Original statement and domain (`original-manuscript-verbatim.md`, lines 171–184): + +> **Input H ([HT, Corollary 1.3, printed page 417]).** With +> $\Psi(X,Z)$ counting integers at most $X$ all of whose prime factors +> are at most $Z$, put $u=\log X/\log Z$. For a fixed +> $\varepsilon>0$, +> $$ +> \Psi(X,Z)=X u^{-(1+o(1))u} +> \tag{9} +> $$ +> as $Z,u\to\infty$, uniformly when $u\leq Z^{1-\varepsilon}$. +> The formula and its range were read from the primary page image: this is +> the printed range of Corollary 1.3 (p. 417). In $x,y$ the source restates +> the underlying range (1.13) of its Theorem 1.2 as +> $(\log x)^{1+\varepsilon}\leq y\leq x$, (1.13)$'$ on p. 418. +> We will use only its upper-bound consequence. + +### O3. OPEN — The arbitrary fixed A>4 route (original Eqs. 23–24) + +Quantified parameter limits underlying Eq.23 are proved for $A\ge4$ with $B=\operatorname{chooseB}(A)$. The printed smooth equality and $o(y/L)$ conclusion for every fixed $A>4$ in Eq.24 are not proved. The main theorem fixes $A=12$; its logarithmic shape is unchanged. + + +Original statement and domain (`original-manuscript-verbatim.md`, lines 389–413): + +> ### 6.3 The smooth-number term +> +> Set $X=m+2$, $Z=z_1$. Then +> $$ +> \log X=L+O(L_2),\qquad +> u=\frac{\log X}{\log Z}\sim\frac{A L_2}{L_3}. +> \tag{23} +> $$ +> Both $u$ and $Z$ tend to infinity. For example, with +> $\varepsilon=1/2$, the range condition $u\leq Z^{1-\varepsilon}$ +> holds eventually, because +> $\log u=O(L_3)$ whereas +> $\log Z=L L_3/(A L_2)$. +> +> Moreover $u\log u=(A+o(1))L_2$. Input H therefore implies +> $$ +> \Psi(m+2,z_1) +> =(m+2)L^{-A+o(1)} +> =o(y/L)\qquad(A>4). +> \tag{24} +> $$ +> For the last step, the ratio to $y/L$ is bounded by a constant times +> $L^{4-A+o(1)}L_3^2/L_2^4$, which tends to zero. +> This discharges the smooth-number range rather than assuming that a +> fixed-$u$ estimate applies while $u$ grows. + +### O4. OPEN — Dyadic prime-count asymptotic (original Eq. 10) + +The coefficient-$1/2$ asymptotic is not proved. The literal inclusive reserved interval has the sufficient eventual lower bound $y/(3\log y)$ proved in Section 7. + + +Original statement and domain (`original-manuscript-verbatim.md`, lines 186–192): + +> **Input P.** The prime number theorem gives +> $$ +> \pi(y)-\pi(y/2)\sim\frac{y}{2\log y}. +> \tag{10} +> $$ +> No explicit prime-count threshold is required. This is the final counting +> input in [KK, section 2] and [R4, section 7]. + +### O5. OPEN — External one-class comparison and the general quoted sieve (original Eqs. 5–7, 11) + +The full external Ford–Green–Konyagin–Maynard–Tao one-class theorem and the quoted arbitrary-kappa/multiplicative-g/nonnegative-weight sieve are not established here as those statements. Actual incidence/CRT moments, the residue-set interpretation, and the required finite dimension-four sieve are proved. The finite cover identity is also proved, and is not an open obligation. + + +Original statement and domain (`original-manuscript-verbatim.md`, lines 116–131): + +> The same argument with one class per prime gives the usual Jacobsthal +> gap $g(P(y))$. Adding a second class cannot destroy a cover, so +> $$ +> G_2(P(y))\geq g(P(y)). +> \tag{4} +> $$ +> Equation (4) is elementary. Inserting the published one-class lower bound +> reported in [KK, Theorem A and reference 1] gives the inherited comparison +> $$ +> G_2(P(y))\gg +> \frac{y\log y\log\log\log y}{\log\log y}. +> \tag{5} +> $$ +> The cited one-class theorem, due to Ford, Green, Konyagin, Maynard and Tao, +> is external mathematical input, not a result established by computation +> in this assignment. + + +Original statement and domain (`original-manuscript-verbatim.md`, lines 138–160): + +> **Input S ([KK, Lemma 1]).** Let $\kappa$ be fixed. For primes $p\leq z$, +> suppose a multiplicative function $g$ satisfies +> $0\leq g(p)\leq\kappa$ and $g(p) $w_t$ satisfy, for every squarefree $d\mid P(z)$, +> $$ +> \sum_{d\mid t}w_t=\frac{Xg(d)}d+r_d,\qquad |r_d|\leq g(d). +> \tag{6} +> $$ +> With $z\ll X$, the quoted lemma bounds their sifted sum by +> $$ +> \sum_{\gcd(t,P(z))=1}w_t +> \ll_\kappa X\prod_{p\leq z}\left(1-\frac{g(p)}p\right). +> \tag{7} +> $$ +> We use only $z\leq X$; its proportionality constant is fixed. +> The statement was read in arXiv v2, page 4, and in the journal's online +> text. Its proof cites Halberstam and Richert, *Sieve Methods* (1974), +> Theorem 2.2. That printed book theorem has not been independently read +> here. A second carrier of the same statement is [FI], Theorem 6.9 with +> Corollary 6.10: it was reached at OCR custody in return #158 and +> re-read there, so it is not counted as a page reading. Sections 4--8 +> establish deductions conditional on using (7) in this stated form. They +> do not reconstruct its underlying sieve proof. + + +Original statement and domain (`original-manuscript-verbatim.md`, lines 196–228): + +> **Lemma 2 (elementary reduction from Input S).** For sets +> $\Omega_p\subset\mathbb Z/p\mathbb Z$ with +> $g(p)=|\Omega_p|\leq\kappa$ and $g(p) $$ +> S(X,\Omega)= +> \#\{1\leq n\leq X:n\bmod p\notin\Omega_p +> \text{ for every }p\leq z\}, +> \qquad +> V(z)=\prod_{p\leq z}\left(1-\frac{g(p)}p\right). +> $$ +> For integral $X$ and $z\ll X$, Input S implies +> $$ +> S(X,\Omega)\ll_\kappa X V(z). +> \tag{11} +> $$ +> +> **Proof.** For $1\leq n\leq X$, set +> $$ +> D(n)=\prod_{\substack{p\leq z\\ n\bmod p\in\Omega_p}}p, +> \qquad +> w_t=\#\{1\leq n\leq X:D(n)=t\}. +> \tag{12} +> $$ +> The empty product is 1. These are nonnegative weights with finite support. +> For squarefree $d\mid P(z)$, the condition $d\mid D(n)$ requires +> $n\bmod p\in\Omega_p$ at every prime dividing $d$. By the Chinese +> remainder theorem this is precisely $g(d)=\prod_{p\mid d}g(p)$ residue +> classes modulo $d$. Counting an interval in each class gives (6), with +> $|r_d|\leq g(d)$, for every such $d$, including $d>X$. +> +> Since $D(n)\mid P(z)$, it is coprime to $P(z)$ exactly when +> $D(n)=1$. Hence the left side of (7) is exactly $S(X,\Omega)$. +> Applying Input S proves (11). $\square$ + +### O6. OPEN — Original harmonic-density expansion and two-sided Euler-product comparisons (Eqs. 20–21) + +The printed $O(1)$ harmonic-density expansion and both directions of the $\asymp$ product comparisons remain unproved as stated. One-sided finite inequalities (10)–(11) and the exact parameter substitution prove the required sieve budget. + + +Original statement and domain (`original-manuscript-verbatim.md`, lines 355–387): + +> ### 6.2 The product calculation +> +> The two small primes contribute a bounded term, so Input M yields +> $$ +> \sum_{p\leq\sqrt y}\frac{g(p)}p +> =2\log\log\sqrt y+ +> 2(\log\log z_1-\log\log z_0)+O(1). +> \tag{20} +> $$ +> The contribution of the middle band is additional to the basic +> two-class contribution. Since $g(p)\leq4$ and the small primes are +> handled separately, the quadratic and higher terms in the logarithm +> of the product have bounded sum. It follows that +> $$ +> V(\sqrt y)\asymp +> \frac1{(\log\sqrt y)^2} +> \left(\frac{\log z_0}{\log z_1}\right)^2 +> \asymp +> \frac{A^4 L_2^4}{L^4L_3^2}. +> \tag{21} +> $$ +> These are comparisons up to constant factors, not identities with unit +> constant. In particular, exponentiating an $O(1)$ in (20) does not +> remove it. +> +> Multiplying (21) by (13) gives +> $$ +> S(m,\Omega)\ll \frac{A^4}{B}\frac{y}{L}. +> \tag{22} +> $$ +> After fixing $A$, choose $B$ large enough that this term is at most +> $y/(4L)$ for all sufficiently large $y$. We have not assigned a +> numerical value to the sieve constant. + +### O7. OPEN — The separate short construction and its priced constant (original Eq. 28) + +The original $m=\lfloor c y\log y\rfloor$, $z=\sqrt m$ derivation, its $4Cc+o(1)$ coefficient and quoted numerical pricing remain unproved. The original Eq.27 endpoint is actually proved by PrimaryMain.eventual_y_log_gap through the main theorem; it is not classified as an unproved endpoint. + + +Original statement and domain (`original-manuscript-verbatim.md`, lines 455–484): + +> For completeness, let $m=\lfloor c y\log y\rfloor$ and +> $z=\sqrt m$, with $c>0$ fixed and sufficiently small. +> Choose $a_p=0$ for $p\leq z$. +> +> Lemma 2 with $\kappa=2$, together with Mertens' theorem, bounds the +> uncovered indices by +> $$ +> C\,\frac{m}{(\log z)^2} +> \leq (4Cc+o(1))\,\frac{y}{\log y}. +> \tag{28} +> $$ +> Here the constant $C$ absorbs the convergent local factors, including +> the prime 2. Since $z=o(y)$, the number of unused primes is +> $\pi(y)-\pi(z)\sim y/\log y$. Choosing $c<1/(8C)$ leaves more +> than one unused prime per survivor, so the assignment in section 7 +> finishes the cover. +> +> If that constant is priced at all, the cited form gives +> $C=2C_2e^{-2\gamma}C_1=0.41621\,C_1$ with $C_1(1/2)=805.5$ +> ($\delta=0.05$, $K=3$), so any $0 ([FI, Theorem 6.9 and Corollary 6.10], conditional on that reading). +> The value $7.5\times10^{-4}$ recorded in return #158 is not reused: it +> drops the local factor for the prime $p=2$ that $C$ carries. That is a +> priced constant, not a certified threshold. +> +> This argument does not use the smooth-number input, but it still uses +> Input S. It cannot be described as having escaped the unread +> Halberstam--Richert source dependency. Its composition has the same +> project-derived, unrefereed status. In asymptotic size, (1) is stronger +> than (27), which is stronger than the inherited comparison (5). + + +## 10. Source correspondence and review boundary + +The source map accompanying this paper records each section's frozen files, declaration locators, exact source hashes, and statement qualifications. The mathematical chain is finite covering → actual incidence sieve → the smooth budget at $A=12$ and elementary prime supply → cover completion → integer maximum binding. Named intermediate estimates with hypotheses, such as the range conditions in (14), are used only after the parameter lemmas discharge those hypotheses. A definition of a target proposition is not treated as its proof. + +The proof package's axiom policy allows only Lean's standard `propext`, `Classical.choice`, and `Quot.sound`; individual closures may use a subset. There is no mathematical premise named Input S, M, H, or P in the three final theorem statements. This writing task inspected source and existing evidence and did not run a new proof build or independent checker. Compiler and kernel evidence belongs to its pinned proof package. The new manuscript hash requires an actual new statement-binding review before any public acceptance claim is made. + +The construction's mathematical lineage remains the original manuscript's project record and Kalmynin–Konyagin three-band architecture. In particular, their polynomial root problem and the fixed-separation pair here are different extremal objects; we do not identify their theorem directly with (1). The finite Möbius/diagonalization adaptation in `SelbergFinite.lean` retains its Arend Mellendijk copyright and PNT+ source credit. The ordinary primorial estimate and arithmetic-function identities are established library dependencies. Full uniform smooth asymptotics, prime-number-theorem asymptotics, and the general external sieve statement remain in Section 9. + +Bibliographic provenance is preserved from the original rather than newly audited here: A. B. Kalmynin and S. V. Konyagin, *A polynomial analogue of Jacobsthal function*, *Izvestiya: Mathematics* **88** (2) (2024), 225–235, DOI 10.4213/im9467e, arXiv:2302.00459v2; A. Hildebrand and G. Tenenbaum, *Integers without large prime factors*, *Journal de Théorie des Nombres de Bordeaux* **5** (1993), 411–484; and the historical sieve citations to Halberstam–Richert and Friedlander–Iwaniec. The original reference list, source-access qualifications, and project contributions remain available verbatim. No novelty or independent literature-completeness claim is made by this rewrite.