Skip to content

Erdős problem 137

Start work

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?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:9f66c0816ae70e42acdefad16b10aed435d49088b4bf576bb45dd960307fc4ca
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON