Skip to content

Erdős problem 394

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.

Sources

The source's own material, retained exactly.

10 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

394.lean

Retained formal statement9 of 9

The least positive multiple of n is n, so t 1 n = n.

FormalConjectures/ErdosProblems/394.leanErdos394.t_one1 lineExact file
∀ {n : ℕ}, 0 < n → Erdos394.t 1 n = n
APIStatement only, no proof