E890:Erdős Problem #890 “Do blocks have small lower-limit counts of large prime factors?”

2)V2The liminf bound in Erdős Problem 890(a) holds for block width k=1.

1)V1For every k≥1, is the liminf of the total number of distinct prime factors greater than k across k consecutiv…