Erdős problem 137

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

Nothing has been recorded here yet.

How far the record reaches3 of 6 stages

What this record is missingResolution

No source retained here records an outcome for this question.

Its collection still marks it open.

Where the source files it575 share a topic

Carrying a Standing. Browse the topic.