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$ ?

Sources

Browse retained paths and inspect the exact material available for this Problem.

3 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

137.lean

Retained formal statement1 of 3

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$ ?

FormalConjectures/ErdosProblems/137.leanErdos137.erdos_1371 lineExact file

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

OpenStatement only, no proof

Sources

Search problems.science