Skip to content

Erdős problem 680

Is it true that, for all sufficiently large nn, there exists some kk such that p(n+k)>k2+1, p(n+k)>k^2+1, where p(m)p(m) denotes the least prime factor of mm?

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:7217d07e5440c83a2bfc40545c93094360be8d5197dfd03fa10a325911ab6cc1
Metadata
sha256:dda37159357a94ef8f8d99e6495b8b683603607256807b88ee83786bc47fb577
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:86fe89ad4ed29fa54d4c0813f21a39e719e0a1c0ab43fe8f16310662b0be1c74
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page