Re:Squared Digit Sum
by cperciva on Sunday March 25, 2018 @12:59AM
(#16670843)
Not at all obvious. It is a very open question whether prime gaps are bounded by ~(log N)^2... AFAIK, even assuming the GRH, the best upper bound is roughly N^(1/2).
[ Parent
| on HN ]