/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/
module
public import FormalConjecturesUtilErdős Problem 978
Reference:
[Ho67] Hooley, C., On the power free values of polynomials. Mathematika (1967), 21--26.
[Br11] Browning, T. D., Power-free values of polynomials. Arch. Math. (Basel) (2011), 139--150.
[Er53] Erdős, P., Arithmetical properties of polynomials. J. London Math. Soc. (1953), 416--425.
[OAI26a] OpenAI, Squarefree values of quartics and power-free values of polynomials. OpenAI Math Release preprint (2026). https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Squarefree-values-of-quartics-and-power-free-values-of-polynomials-September-24-2026/manuscript.pdf
@[expose] public sectionopen Polynomial Setnamespace Erdos978
Let f ∈ ℤ[X] be an irreducible polynomial with positive leading coefficient. Suppose that the
degree k of f is larger than 2 and is not equal to a power of 2. Then the set of n such
that f n is (k - 1)-th power free is infinite, and this is proved in [Er53].
@[category research solved, AMS 11]
theorem erdos_978.variants.sub_one {f : ℤ[X]} (hi : Irreducible f) (hd : 2 < f.natDegree)
(hp : ∀ (x : ℕ), f.natDegree ≠ 2 ^ x) (hlc : 0 < f.leadingCoeff) :
{n : ℕ | Powerfree (f.natDegree - 1) (f.eval (n : ℤ))}.Infinite := f:ℤ[X]hi:Irreducible fhd:2 < f.natDegreehp:∀ (x : ℕ), f.natDegree ≠ 2 ^ xhlc:0 < f.leadingCoeff⊢ {n | Powerfree (f.natDegree - 1) (eval (↑n) f)}.Infinite
All goals completed! 🐙
Let f ∈ ℤ[X] be an irreducible polynomial with positive leading coefficient. Suppose that the
degree k of f is larger than 2, is not equal to a power of 2, and f n has no fixed
(k - 1)-th power divisors other than 1. Then the set of n such that f n is (k - 1)-th
power free has positive density, and this is proved in [Ho67].
@[category research solved, AMS 11]
theorem erdos_978.parts.i {f : ℤ[X]} (hi : Irreducible f) (hd : 2 < f.natDegree)
(hp2 : ∀ (x : ℕ), f.natDegree ≠ 2 ^ x) (hlc : 0 < f.leadingCoeff)
(hp : ∀ (p : ℕ), p.Prime → ∃ n : ℕ, ¬ (p : ℤ) ^ (f.natDegree - 1) ∣ f.eval (n : ℤ)) :
HasPosDensity {n : ℕ | Powerfree (f.natDegree - 1) (f.eval (n : ℤ))} := f:ℤ[X]hi:Irreducible fhd:2 < f.natDegreehp2:∀ (x : ℕ), f.natDegree ≠ 2 ^ xhlc:0 < f.leadingCoeffhp:∀ (p : ℕ), Nat.Prime p → ∃ n, ¬↑p ^ (f.natDegree - 1) ∣ eval (↑n) f⊢ {n | Powerfree (f.natDegree - 1) (eval (↑n) f)}.HasPosDensity
All goals completed! 🐙
If the degree k of f is larger than or equal to 9, and f n has no fixed (k - 2)-th
power divisors other than 1, then the set of n such that f n is (k - 2)-th power free has
infinitely many elements. This result is proved in [Br11].
@[category research solved, AMS 11]
theorem erdos_978.variants.sub_two {f : ℤ[X]} (hi : Irreducible f) (hd : 9 ≤ f.natDegree)
(hp : ∀ (p : ℕ), p.Prime → ∃ n : ℕ, ¬ (p : ℤ) ^ (f.natDegree - 2) ∣ f.eval (n : ℤ)) :
{n : ℕ | Powerfree (f.natDegree - 2) (f.eval (n : ℤ))}.Infinite := f:ℤ[X]hi:Irreducible fhd:9 ≤ f.natDegreehp:∀ (p : ℕ), Nat.Prime p → ∃ n, ¬↑p ^ (f.natDegree - 2) ∣ eval (↑n) f⊢ {n | Powerfree (f.natDegree - 2) (eval (↑n) f)}.Infinite
All goals completed! 🐙If $k > 3$ (and $k \neq 2^l$), then are there infinitely many $n$ for which $f(n)$ is $(k-2)$-power-free?
This was disproved by the DeepMind prover agent.
@[category research solved, question, AMS 11,
formal_proof using formal_conjectures at "https://github.com/mo271/formal-conjectures/blob/3b5d6ac2555cd63b83d418c29ff040876be9dee0/FormalConjectures/ErdosProblems/978.lean#L64"]
theorem erdos_978.variants.allow_fixed_divisors :
¬ ∀ {f : ℤ[X]}, Irreducible f → f.natDegree > 3 →
(¬ ∃ l : ℕ, f.natDegree = 2 ^ l) → 0 < f.leadingCoeff →
(¬ ∃ p : ℕ, p.Prime ∧ ∀ n : ℕ, (p : ℤ) ^ (f.natDegree - 1) ∣ f.eval (n : ℤ)) →
{n : ℕ | Powerfree (f.natDegree - 2) (f.eval (n : ℤ))}.Infinite := ⊢ ¬∀ {f : ℤ[X]},
Irreducible f →
f.natDegree > 3 →
(¬∃ l, f.natDegree = 2 ^ l) →
0 < f.leadingCoeff →
(¬∃ p, Nat.Prime p ∧ ∀ (n : ℕ), ↑p ^ (f.natDegree - 1) ∣ eval (↑n) f) →
{n | Powerfree (f.natDegree - 2) (eval (↑n) f)}.Infinite
All goals completed! 🐙If $k>3$ (and $k \neq 2^l$), and for all primes $p$ there exists $n$ such that $p^{k-2}\nmid f(n)$, then are there infinitely many $n$ for which $f(n)$ is $(k-2)$-power-free?
This was proved by an internal OpenAI model in September 2026 [OAI26a]; see the linked Lean proof, which gives positive density and does not need $k \neq 2^l$ or a positive leading coefficient.
@[category research solved, question, AMS 11, formal_proof using lean4 at
"https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/NumberTheory/PowerFree/Main.lean#L144"]
theorem erdos_978.parts.ii :
∀ {f : ℤ[X]}, Irreducible f → f.natDegree > 3 →
(¬ ∃ l : ℕ, f.natDegree = 2 ^ l) → 0 < f.leadingCoeff →
(∀ (p : ℕ), p.Prime → ∃ n : ℕ, ¬ (p : ℤ) ^ (f.natDegree - 2) ∣ f.eval (n : ℤ)) →
{n : ℕ | Powerfree (f.natDegree - 2) (f.eval (n : ℤ))}.Infinite := ⊢ ∀ {f : ℤ[X]},
Irreducible f →
f.natDegree > 3 →
(¬∃ l, f.natDegree = 2 ^ l) →
0 < f.leadingCoeff →
(∀ (p : ℕ), Nat.Prime p → ∃ n, ¬↑p ^ (f.natDegree - 2) ∣ eval (↑n) f) →
{n | Powerfree (f.natDegree - 2) (eval (↑n) f)}.Infinite
All goals completed! 🐙
Does n ^ 4 + 2 represent infinitely many squarefree numbers?
This was proved by an internal OpenAI model in September 2026 [OAI26a]; see the linked Lean proof, which gives positive density for every irreducible quartic with no fixed square divisor.
@[category research solved, question, AMS 11, formal_proof using lean4 at
"https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/NumberTheory/PowerFree/Main.lean#L144"]
theorem erdos_978.parts.iii : {n : ℕ | Squarefree (n ^ 4 + 2)}.Infinite := ⊢ {n | Squarefree (n ^ 4 + 2)}.Infinite
All goals completed! 🐙end Erdos978