OctoInformBeta

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

§1 (setting): For a nonnegative integer kk and a polynomial ff over ℤ\mathbb{Z}, defining kk-power-free integers and the asymptotic density statement

Local admissibility and density of power-free polynomial values.

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∈ℤ[t]f \in \mathbb{Z}[t] and a nonnegative integer kk. As nn ranges over the positive integers, the question is how often f(n)f(n) avoids kk-th powers of primes and how congruence obstructions across primes pp modulo pkp^k determine an asymptotic density.

The Definition

Definition 1. Given a nonnegative integer k∈ℕk \in \mathbb{N}, an integer m∈ℤm \in \mathbb{Z} is kk-power-free if no prime kk-th power pkp^k divides mm: m is k-power-free⇔pk∤mfor every prime p.m \text{ is } k\text{-power-free} \iff p^k \nmid m \quad \text{for every prime } p.(1)✦

The local congruence count ρf(q)\rho_f(q) of a polynomial f∈ℤ[t]f \in \mathbb{Z}[t] modulo a nonnegative integer q∈ℕq \in \mathbb{N} is the number of residue classes amod⁡qa \bmod q with q∣f(a)q \mid f(a): ρf(q)=#{a∈ℤ:0≤a<q and q∣f(a)}.\rho_f(q) = \#\{a \in \mathbb{Z} : 0 \le a < q \text{ and } q \mid f(a)\}.(2)✦

For a polynomial f∈ℤ[t]f \in \mathbb{Z}[t], a nonnegative integer k∈ℕk \in \mathbb{N}, and a real number X∈ℝX \in \mathbb{R}, the counting function Sf,k(X)S_{f,k}(X) is the number of positive integers n≤⌊X⌋n \le \lfloor X \rfloor at which f(n)f(n) is kk-power-free in the sense of (1): Sf,k(X)=#{n∈ℤ:1≤n≤⌊X⌋ and f(n) is k-power-free}.S_{f,k}(X) = \#\{n \in \mathbb{Z} : 1 \le n \le \lfloor X \rfloor \text{ and } f(n) \text{ is } k\text{-power-free}\}.(3)✦

A polynomial f∈ℤ[t]f \in \mathbb{Z}[t] is locally admissible for a nonnegative integer k∈ℕk \in \mathbb{N} if its local congruence counts (2) satisfy ρf(pk)<pk\rho_f(p^k) < p^k at every prime pp: f is locally admissible for k⇔ρf(pk)<pkfor every prime p.f \text{ is locally admissible for } k \iff \rho_f(p^k) < p^k \quad \text{for every prime } p.(4)✦

At each prime pp, the local Euler factor δf,k(p)\delta_{f,k}(p) of a polynomial f∈ℤ[t]f \in \mathbb{Z}[t] and a nonnegative integer k∈ℕk \in \mathbb{N} is the real number giving the fraction of residue classes amod⁡pka \bmod p^k with pk∤f(a)p^k \nmid f(a), defined from (2) by δf,k(p)=1−ρf(pk)pk.\delta_{f,k}(p) = 1 - \frac{\rho_f(p^k)}{p^k}.(5)✦

Associated to a polynomial f∈ℤ[t]f \in \mathbb{Z}[t] and a nonnegative integer k∈ℕk \in \mathbb{N}, the asymptotic density constant cf,kc_{f,k} is the real number given by the infinite product of the local Euler factors (5) over all primes pp: cf,k=∏pδf,k(p).c_{f,k} = \prod_{p} \delta_{f,k}(p).(6)✦

For a polynomial f∈ℤ[t]f \in \mathbb{Z}[t] and a nonnegative integer k∈ℕk \in \mathbb{N}, the asymptotic density statement is the assertion that the Euler product (6) of the local factors (5) converges unconditionally, cf,k>0c_{f,k} > 0, and the counting function (3) obeys Sf,k(X)−cf,kX=o(X)S_{f,k}(X) - c_{f,k} X = o(X) as X→∞X \to \infty: The asymptotic density statement holds for (f,k)⇔∏pδf,k(p) converges unconditionally, cf,k>0,and Sf,k(X)−cf,kX=o(X) as X→∞.\begin{aligned} \text{The asymptotic density statement holds for } (f, k) \iff {} & \prod_{p} \delta_{f,k}(p) \text{ converges unconditionally, } c_{f,k} > 0, \\ &\text{and } S_{f,k}(X) - c_{f,k} X = o(X) \text{ as } X \to \infty. \end{aligned}(7)✦

What Is Checked

The definitions (1), (2), (3), (4), (5), (6), and (7) are stated over polynomials f∈ℤ[t]f \in \mathbb{Z}[t], integers m∈ℤm \in \mathbb{Z}, nonnegative integers k,q∈ℕk, q \in \mathbb{N}, primes pp, and real numbers X∈ℝX \in \mathbb{R}.