1
$\begingroup$

$p_i$ is the $i^{\rm th}$ prime. $\pi(x)$ is prime counting function.

Firstly, I think that Prime gap inequality holds true for any $i>0$: $p_{i+1} - p_{i} \leq i$.

Very often, $\pi(p_{m}+m) - m \leq \pi(p_{n}+n) - n$ if $m \pi(19+8)-8$ . I conjecture there exists infinite this sort of counter examples. In math words,

Conjecture:$ \forall x , \exists m,n$, satisfy $ x and $\pi(p_{m}+m) - m > \pi(p_{n}+n) - n$.

  • 1
    I have editing the typesetting a bit. Most significantly, I have replaced the $p[i]$ notation with the more standard subscript notation $p_i$. I haven't changed the wording otherwise. Hope this is ok. (My edit will be visible to all only after it is peer-reviewed.)2011-07-30
  • 0
    very kind of you!2011-07-30
  • 0
    How much and what kind of evidence do you have supporting your conjecture? Did you run some computer experiments (this should be rather easy to do)?2011-07-30
  • 0
    @Theo p = Prime; pi = PrimePi; Table[pi[p[n] + n] - n, {n, 400, 500}]2011-07-30
  • 0
    This [MO post](http://mathoverflow.net/questions/71639/) (by the same poster, I presume) seems related, but NOT a duplicate.2011-07-30
  • 1
    Thanks. I don't have Mathematica, so I can't use your code (well - I could achieve that easily with sage, too, of course, if I wanted to). However, I was intending to suggest something that doesn't take a few microseconds only but would be a *serious* test. I mean, $\sim 35'000$ isn't very big.2011-07-30
  • 0
    @Srivatsan, Good eye! Yes, I posted a related question on MO.2011-07-30
  • 0
    t = Table[pi[p[n] + n] - n, {n, 100000, 101000}]; ListPlot[{t}]2011-07-30
  • 0
    What is the question?2011-07-30

0 Answers 0