OctoInformBeta

OpenAI preprint, September 2026 · §1. Setting and main results

Proposition 1.4: Power savings at large scales when irreducible over ℚ\mathbb{Q}: 3/10003/1000 for degrees 4≤d≤84 \le d \le 8 with positive leading coefficient and 1/20001/2000 for d≥9d \ge 9

Explicit dyadic tail bounds for primitive integer polynomials.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Take a primitive polynomial f∈ℤ[x]f \in \mathbb{Z}[x] of degree d≥4d \ge 4 that is irreducible over ℚ\mathbb{Q}, and write k=d−2k = d - 2 for the power-freeness exponent, where an integer mm is kk-free if no prime kk-th power pkp^k divides mm. In studying kk-free values of ff on dyadic ranges, the question is what explicit power-saving bound of the form CN1−δC N^{1-\delta}, with real constants C>0C > 0 and δ>0\delta > 0, holds for the dyadic tail at all sufficiently large scales NN.

Definitions

For a polynomial f∈ℤ[x]f \in \mathbb{Z}[x] and natural numbers kk and MM, the dyadic tail count is defined by Tf,k(M)=#{n∈(M,2M]:∃ prime p>M with pk∣f(n)}T_{f,k}(M) = \#\{n \in (M, 2M] : \exists\text{ prime } p > M \text{ with } p^k \mid f(n)\}.

The Claim

Theorem 1. Let f∈ℤ[x]f \in \mathbb{Z}[x] be a primitive polynomial of degree d≥4d \ge 4 that is irreducible over ℚ\mathbb{Q}, and put k=d−2k = d - 2.

  1. If d=4d = 4 and ff has positive leading coefficient, then there exists a real constant C>0C > 0 such that for all sufficiently large natural numbers NN, Tf,k(N)≤CN1−3/1000.T_{f,k}(N) \le C N^{1 - 3/1000}.(1)✦

  2. If 5≤d≤85 \le d \le 8 and ff has positive leading coefficient, then there exists a real constant C>0C > 0 such that for all sufficiently large natural numbers NN, Tf,k(N)≤CN1−3/1000.T_{f,k}(N) \le C N^{1 - 3/1000}.(2)✦

  3. If d≥9d \ge 9, then there exists a real constant C>0C > 0 such that for all sufficiently large natural numbers MM, Tf,k(M)≤CM1−1/2000.T_{f,k}(M) \le C M^{1 - 1/2000}.(3)✦

In the paper, the result reads: for a primitive and irreducible polynomial f∈ℤ[x]f \in \mathbb{Z}[x] with positive leading coefficient and degree 4≤d≤84 \le d \le 8, putting k=d−2k = d - 2, there exists δ=δf>0\delta = \delta_f > 0 such that #{n∈ℤ:X<n≤2X,pk∣f(n) for some prime p>X}≪fX1−δ\#\{n \in \mathbb{Z} : X < n \le 2X, p^k \mid f(n) \text{ for some prime } p > X\} \ll_f X^{1-\delta}.

What Is Checked

Each of (1), (2), and (3) is stated over primitive polynomials f∈ℤ[x]f \in \mathbb{Z}[x] of degree d≥4d \ge 4 irreducible over ℚ\mathbb{Q}, with positive leading coefficient when d=4d = 4 or 5≤d≤85 \le d \le 8 and with no sign condition on the leading coefficient when d≥9d \ge 9, together with the dyadic tail count Tf,kT_{f,k} at exponent k=d−2k = d - 2 and natural-number scales.