OctoInformBeta

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

Corollary 1.2: For integer polynomials of degree d≥4d \ge 4 (and separately d≥9d \ge 9), positive convergent Euler products and linear (d−2)(d-2)-power-free asymptotics

Power-free density for locally admissible ℚ\mathbb{Q}-irreducible 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 polynomial f∈ℤ[x]f \in \mathbb{Z}[x] of degree d≥4d \ge 4 that is irreducible over ℚ\mathbb{Q}, and set k=d−2k = d - 2. For a quartic (d=4d = 4, k=2k = 2), the question is how often f(n)f(n) avoids every prime square p2p^2 as nn runs over positive integers up to XX; in general, how often is f(n)f(n) divisible by no prime kk-th power pkp^k? When no prime kk-th power pkp^k divides every value of ff on ℤ\mathbb{Z}, does this count grow linearly in XX with a positive Euler product as leading factor?

Definitions

Given an integer k≥0k \ge 0, an integer m∈ℤm \in \mathbb{Z} is kk-power-free if pk∤mp^k \nmid m for every prime pp, so 00 is excluded while negative integers are allowed.✦

The counting function Sf,k(X)S_{f,k}(X) of a polynomial f∈ℤ[x]f \in \mathbb{Z}[x], an integer k≥0k \ge 0, and a real number XX is the number of integers 1≤n≤⌊X⌋1 \le n \le \lfloor X \rfloor for which f(n)f(n) is kk-power-free: Sf,k(X)=#{1≤n≤⌊X⌋:f(n) is k-power-free}.S_{f,k}(X) = \#\{1 \le n \le \lfloor X \rfloor : f(n) \text{ is } k\text{-power-free}\}.(1)✦

For a polynomial f∈ℤ[x]f \in \mathbb{Z}[x] and a nonnegative integer qq, the modular root count ρf(q)\rho_f(q) is the number of residue classes amod⁡qa \bmod q with q∣f(a)q \mid f(a): ρf(q)=#{0≤a<q:q∣f(a)}.\rho_f(q) = \#\{0 \le a < q : q \mid f(a)\}.(2)✦

At each prime pp, the local factor of a polynomial f∈ℤ[x]f \in \mathbb{Z}[x] and an integer k≥0k \ge 0 is the real number 1−ρf(pk)/pk1 - \rho_f(p^k)/p^k.✦

The asymptotic density constant cf,kc_{f,k} of a polynomial f∈ℤ[x]f \in \mathbb{Z}[x] and an integer k≥0k \ge 0 is the Euler product of the local factors over all primes pp: cf,k=∏p(1−ρf(pk)pk).c_{f,k} = \prod_p \left(1 - \frac{\rho_f(p^k)}{p^k}\right).(3)✦

A polynomial f∈ℤ[x]f \in \mathbb{Z}[x] is locally admissible for an integer k≥0k \ge 0 if ρf(pk)<pk\rho_f(p^k) < p^k for every prime pp.✦

A polynomial f∈ℤ[x]f \in \mathbb{Z}[x] and an exponent k≥0k \ge 0 satisfy the asymptotic density statement if the infinite product of the local factors over all primes converges, the asymptotic density constant cf,kc_{f,k} is strictly positive, and the counting function Sf,k(X)S_{f,k}(X) satisfies Sf,k(X)=cf,kX+o(X)S_{f,k}(X) = c_{f,k} X + o(X) as X→∞X \to \infty.✦

The Claim

Theorem 1. Let f∈ℤ[x]f \in \mathbb{Z}[x] be irreducible over ℚ\mathbb{Q} of degree dd, set k=d−2k = d - 2, and suppose that ff is locally admissible for kk. When d≥4d \ge 4, an asymptotic density statement holds in (4) and (5); when d≥9d \ge 9, it holds in (6): ∏p(1−ρf(pk)pk) converges,cf,k>0,Sf,k(X)=cf,kX+o(X)(X→∞,d≥4),\prod_p \left(1 - \frac{\rho_f(p^k)}{p^k}\right) \text{ converges}, \quad c_{f,k} > 0, \quad S_{f,k}(X) = c_{f,k} X + o(X) \quad (X \to \infty,\ d \ge 4),(4)✦ ∏p(1−ρf(pk)pk) converges,cf,k>0,Sf,k(X)=cf,kX+o(X)(X→∞,d≥4),\prod_p \left(1 - \frac{\rho_f(p^k)}{p^k}\right) \text{ converges}, \quad c_{f,k} > 0, \quad S_{f,k}(X) = c_{f,k} X + o(X) \quad (X \to \infty,\ d \ge 4),(5)✦ ∏p(1−ρf(pk)pk) converges,cf,k>0,Sf,k(X)=cf,kX+o(X)(X→∞,d≥9).\prod_p \left(1 - \frac{\rho_f(p^k)}{p^k}\right) \text{ converges}, \quad c_{f,k} > 0, \quad S_{f,k}(X) = c_{f,k} X + o(X) \quad (X \to \infty,\ d \ge 9).(6)✦

What Is Checked

The claims (4) and (5) for degree d≥4d \ge 4 and (6) for d≥9d \ge 9 are stated over polynomials f∈ℤ[x]f \in \mathbb{Z}[x] irreducible over ℚ\mathbb{Q} with exponent k=d−2k = d - 2 satisfying local admissibility for kk, in terms of kk-power-free integers, the counting function Sf,k(X)S_{f,k}(X), the modular root counts ρf(q)\rho_f(q), the local factors at each prime, and the asymptotic density constant cf,kc_{f,k}.