Erdős problem 137 · problems.science

Let $k\geq 3$ . Can the product of any $k$ consecutive integers $N$ ever be powerful? That is, must there always exist a prime $p\mid N$ such that $p^2\nmid N$ ?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/137.lean

Formal Conjectures

FormalConjectures/ErdosProblems/137.leanErdos137.erdos_1371 lineExact file

1sorry ↔ ∀ k ≥ 3, ∀ (n : ℕ), ¬(∏ x ∈ Finset.Ioc n (n + k), x).Powerful

OpenStatement only, no proof

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Continue

Search problems.science