OctoInformBeta

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

Theorem 1.1: A polynomial f∈ℤ[x]f \in \mathbb{Z}[x] irreducible over ℚ\mathbb{Q} of degree d≥4d \ge 4, locally admissible for d−2d - 2, has positive density of (d−2)(d-2)-free values

Asymptotic density of power-free values for 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 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 d=4d = 4 this asks how often f(n)f(n) is squarefree as nn runs through the positive integers, and for d≥5d \ge 5 how often f(n)f(n) is free of prime kk-th powers. These notes go through the resulting asymptotic density theorems and the definitions they are built on.

Power-free Values and Local Densities

An integer m∈ℤm \in \mathbb{Z} is kk-free, for a nonnegative integer kk, if no prime kk-th power pkp^k divides mm (so 00 is excluded and negative integers are allowed).✦ The counting function Sf,k(X)S_{f,k}(X) associated to a polynomial f∈ℤ[x]f \in \mathbb{Z}[x], an integer k≥0k \ge 0, and a real number X∈ℝX \in \mathbb{R} is Sf,k(X)=#{1≤n≤⌊X⌋:n∈ℤ,f(n) is k-free}.S_{f,k}(X) = \#\{1 \le n \le \lfloor X \rfloor : n \in \mathbb{Z},\ \text{$f(n)$ is $k$-free}\}.(1)✦

For f∈ℤ[x]f \in \mathbb{Z}[x] and an integer q≥1q \ge 1, the congruence 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). At any prime pp, the local factor of f∈ℤ[x]f \in \mathbb{Z}[x] for exponent k≥0k \ge 0 is the real number 1−ρf(pk)/pk1 - \rho_f(p^k)/p^k.✦ Given f∈ℤ[x]f \in \mathbb{Z}[x] and k≥0k \ge 0, the asymptotic density constant cf,kc_{f,k} is the 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).(2)✦

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.✦

The Claim

Theorem 1. Let f∈ℤ[x]f \in \mathbb{Z}[x] be irreducible over ℚ\mathbb{Q} of degree d≥4d \ge 4, set k=d−2k = d - 2, and suppose ff is locally admissible for kk. When 4≤d≤84 \le d \le 8, ∏p(1−ρf(pk)pk) converges unconditionally,cf,k>0,Sf,k(X)−cf,kX=o(X) as X→∞.\begin{aligned} &\prod_p \left(1 - \frac{\rho_f(p^k)}{p^k}\right) \text{ converges unconditionally}, \\ &c_{f,k} > 0, \qquad S_{f,k}(X) - c_{f,k} X = o(X) \text{ as } X \to \infty. \end{aligned}(3)✦ For all d≥4d \ge 4, ∏p(1−ρf(pk)pk) converges unconditionally,cf,k>0,Sf,k(X)−cf,kX=o(X) as X→∞.\begin{aligned} &\prod_p \left(1 - \frac{\rho_f(p^k)}{p^k}\right) \text{ converges unconditionally}, \\ &c_{f,k} > 0, \qquad S_{f,k}(X) - c_{f,k} X = o(X) \text{ as } X \to \infty. \end{aligned}(4)✦ If d≥5d \ge 5, ∏p(1−ρf(pk)pk) converges unconditionally,cf,k>0,Sf,k(X)−cf,kX=o(X) as X→∞.\begin{aligned} &\prod_p \left(1 - \frac{\rho_f(p^k)}{p^k}\right) \text{ converges unconditionally}, \\ &c_{f,k} > 0, \qquad S_{f,k}(X) - c_{f,k} X = o(X) \text{ as } X \to \infty. \end{aligned}(5)✦

What Is Checked

Claims (3), (4), and (5) are stated for polynomials f∈ℤ[x]f \in \mathbb{Z}[x] irreducible over ℚ\mathbb{Q} of degree dd (satisfying 4≤d≤84 \le d \le 8, d≥4d \ge 4, and d≥5d \ge 5 respectively) that are locally admissible for k=d−2k = d - 2, in terms of kk-free integers, the counting function Sf,k(X)S_{f,k}(X) of (1), the congruence root count ρf(q)\rho_f(q) for q≥1q \ge 1, the local factors at primes pp, and the asymptotic density constant cf,kc_{f,k} of (2).