Skip to content

Erdős problem 463

Is there a function ff with f(n)f(n)\to\infty as nn\to\infty such that, for all large nn, there is a composite number mm such that n+f(n)<m<n+p(m) n + f(n) < m < n + p(m) Here p(m)p(m) is 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:f82d2277ec3c8bdeb3c41273561f3e46fc1ab7186119e077b7b6c95a1c7390d6
Metadata
sha256:e5a9663a1699bc8a8cb6a9f1f24b0c59acb2ec37cb55169526f2fc5e957524c9
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:0d23468a9dab1d183d706c7424d04d2c364cc0a52f1fbf58b9facb0cdd2e9e02
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page