Skip to content

Erdős problem 394

For the least tk(n)t_k(n) with ntk(n)(tk(n)+1)(tk(n)+k1)n \mid t_k(n)(t_k(n)+1)\cdots(t_k(n)+k-1), do the conjectured logarithmic-saving and adjacent-length estimates hold on average? Both answered affirmatively, with c=1/2048c = 1/2048 admissible in the t2t_2 bound.

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:96c4743cdb1cef548bd515985fff2906ef4629608d1d63cf7ad999a463e3d340
Metadata
sha256:ff8eb494a92e79bcea7918d0365274ca2f1daa557a583b26e8c65f0c5ca5a2c4
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:93358c3bdc64f479a2c97a57a3d9981f91cb97bebc7d8fa128a0071a7db9bdfc
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page