E962:Erdős Problem #962 “Are large-prime-divisor blocks subpolynomially short?”

2)V2For all n, the maximal block length satisfies k(n)≤n, and for n≥1 it also satisfies k(n)≥1.

1)V1If k(n) is the maximum block length attainable below n such that every entry has a prime divisor larger than…