Skip to content

Erdős problem 394

Start work

For the least tk(n)t_k(n) with n∣tk(n)(tk(n)+1)⋯(tk(n)+k−1)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.

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:93358c3bdc64f479a2c97a57a3d9981f91cb97bebc7d8fa128a0071a7db9bdfc
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON