Documentation

FormalConjectures.ErdosProblems.«978»

Erdős Problem 978 #

Reference:

theorem Erdos978.erdos_978.sub_one {f : Polynomial } (hi : Irreducible f) (hd : f.natDegree > 2) (hp : ¬∃ (l : ), f.natDegree = 2 ^ l) :

Let f ∈ ℤ[X] be an irreducible polynomial. 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].

theorem Erdos978.erdos_978.sub_one_density {f : Polynomial } (hi : Irreducible f) (hd : f.natDegree > 2) (hp : ¬∃ (p : ), Nat.Prime p ∀ (n : ), p ^ (f.natDegree - 1) Polynomial.eval (↑n) f) :

Let f ∈ ℤ[X] be an irreducible polynomial. Suppose that the degree k of f is larger than 2, and f n have 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].

theorem Erdos978.erdos_978.sub_two {f : Polynomial } (hi : Irreducible f) (hd : f.natDegree 9) (hp : ¬∃ (p : ), Nat.Prime p ∀ (n : ), p ^ (f.natDegree - 1) Polynomial.eval (↑n) f) :

If the degree k of f is larger than or equal to 9, 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].

theorem Erdos978.erdos_978.sub_two' :
sorry ∀ {f : Polynomial }, Irreducible ff.natDegree > 2(¬∃ (p : ), Nat.Prime p ∀ (n : ), p ^ (f.natDegree - 1) Polynomial.eval (↑n) f) → {n : | Powerfree (f.natDegree - 2) (Polynomial.eval (↑n) f)}.Infinite

Is it true that the set of n such that f n is (k - 2)-th power free has infinitely many elements?

Does n ^ 4 + 2 represent infinitely many squarefree numbers?