Erdős problem 383 · problems.science

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

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.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:6e23f1b7b4016e3d0db492cab33340d79f2f03911c9a438de92760b636e67ce1
Metadata: sha256:588e81e0274cfd0046a85876cedaf9d247ec5fed2e8acaaea7c2c11f6633d037
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:948e7b86aab0d4d80b183a57325c29d65328fd82ecd190cf3422dcd3b50abdf4

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207