Skip to content

Erdős problem 457

Is there some ϵ>0\epsilon > 0 such that there are infinitely many nn where all primes p(2+ϵ)lognp \le (2 + \epsilon) \log n divide 1ilogn(n+i)? \prod_{1 \le i \le \log n} (n + i)?

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:45fe4023fa39e59701f79185b08321dbc0c51adcdbe26874b866c99710a0a961
Metadata
sha256:bcc3428da9552f154ae8028e7b884a1a6d3c5bbc5335d2361a6b38543627292f
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:59eed676b7ab506bd3a09f2c3f032df8ca9d81dde53bfdbced7a3ae4c01f047a
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page