1
$\begingroup$

V.V. Miasoyedov posted a paper to the arXiv claiming a proof of the Hardy-Littlewood conjecture $\pi(x+y) \le \pi(x)+\pi(y)$. It seems a bit off, and not only because the conjecture is widely believed false (incompatible with the $k$-tuple conjecture, as pointed out by Richards.) But when I looked it over I couldn't get a good feeling of what was going on at a higher level, and the details that I saw looked right. (My copy of v1 has each sentence up to (2.3) marked with a check.)

Can anyone confirm that the paper is in error?

Improve this question
$\endgroup$
6
  • 1
    $\begingroup$ After a quick glance, seems hackish too me. $\endgroup$
    – Stanley Yao Xiao
    Commented Jan 7, 2016 at 23:00
  • 6
    $\begingroup$ I think checking claimed proofs is off-topic on this site. $\endgroup$
    – GH from MO
    Commented Jan 7, 2016 at 23:04
  • 4
    $\begingroup$ meta.mathoverflow.net/a/942/4832 $\endgroup$
    – Nate Eldredge
    Commented Jan 7, 2016 at 23:57
  • 4
    $\begingroup$ @tj_: That's not the purpose of this site. It was neither designed for discussions nor for collaboration. Those are not the expectation for many who come here. It would set a bad precedent. We could write a book in post-its stuck to a tree but there are better places for that. Make a wiki and invite people if you are so interested. $\endgroup$
    – Douglas Zare
    Commented Jan 8, 2016 at 2:28
  • 4
    $\begingroup$ The `proof' doesn't seem to use anything specific about primes. Seems to use only that $\pi$ is the counting function of a strongly monotonous sequence $p_1,p_2,\dots$ of integers. Unless I'm overlooking something (have spent less than 30 seconds on the paper), it is utter nonsense. $\endgroup$
    – Peter Mueller
    Commented Jan 8, 2016 at 8:56

0

Reset to default