Skip to content

Erdős problem 383

Start work

Is it true that for every kk there are infinitely many primes pp such that the largest prime divisor of ∏i=0k(p2+i) \prod_{i = 0}^k (p ^ 2 + i) is pp?

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:6e23f1b7b4016e3d0db492cab33340d79f2f03911c9a438de92760b636e67ce1
Metadata
sha256:588e81e0274cfd0046a85876cedaf9d247ec5fed2e8acaaea7c2c11f6633d037
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:948e7b86aab0d4d80b183a57325c29d65328fd82ecd190cf3422dcd3b50abdf4
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON