News for hackers. Stuff that matters.
Re:A prime number whose binary representation looks like a g... by qmalzp on Saturday January 20, 2018 @09:11AM (#16193380)
The average gap is log(n), but the maximal gap is not well understood.

According to https://en.wikipedia.org/wiki/Cram%C3%A9r%27s_conjecture, current results are

Unconditional: n^0.525

Conditional on RH: log(n)*sqrt(n)

Conjecturally: log(n)^2

Re:A prime number whose binary representation looks like a g... by chx on Saturday January 20, 2018 @10:50AM (#16193744)
> It is still probably true that for every constant {\displaystyle c>2} c>2, there is a constant {\displaystyle d>0} d>0 such that there is a prime between {\displaystyle x} x and {\displaystyle x+d(\log x)^{c}} {\displaystyle x+d(\log x)^{c}}

That's quite fascinating.