Skip to content

Erdős problem 649

Start work

Let P(m)P(m) denote the greatest prime factor of mm. Is it true that, for any two primes p,qp,q, there exists some integer nn such that P(n)=pP(n)=p and P(n+1)=qP(n+1)=q?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands 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:13d4543be76c5c08915431c4b39a09a3a25cfd2ea70c5976bca9a209af23bd64
Metadata
sha256:96d95641f1817d904ea1b72e224da889a39305263d65d7878c974cfec1f5fc81
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:4d3454741111972360e641d8218cfba1ba8ce5835730b31ebbf0890d1a1eac5a
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON