Skip to content

Erdős problem 137

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

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:9c8a84bdc20d675cebc5791967a0131d54209057b5b4106164d4558b4bcf9f1a
Metadata
sha256:00bee5c90e49fd2feb731e0d44b7a623f5ac737208b0d7051992a9597ca91896
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:9f66c0816ae70e42acdefad16b10aed435d49088b4bf576bb45dd960307fc4ca
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page