Erdős problem 681 · problems.science

Erdős problem 681. Is it true that for all large $n$ there exists $k$ such that $n + k$ is composite and $p(n+k) > k^2$ , where $p(m)$ is the least prime factor of $m$ ?

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

Problem row: sha256:06c138408d5e71420244707b6dd7fa3ef901e6201aa356d17606f5140c822c48
Metadata: sha256:e4aa8e52928fbac0ead25446b12f82f2e364b04321e4f94df1e22568c7ba2c4c
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:136d1dd072dc748de102f00403fb57ffac6853ac19be31b24a65929c264d5a77

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

Upstream source Inspect records Source JSON

Result history

Correction history

Exact provenance

Search problems.science