2023/03/26 by Alexander Kalmynin, Kalmynin, Alexander, Segei Konyagin +1
Mathematics · #Analytic Number Theory Research #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2303.14833
Let M(x) be the length of the largest subinterval of [1,x] which does not contain any sums of two squareful numbers. We prove a lower bound M(x)≫ (ln x)/((lnln x)2) for all x≥ 3. The proof relies on properties of random subsets of the prime numbers.