3
$\begingroup$

I happened to stumble upon this page. Does anyone know about the validity of this claim?

  • 2
    [prime number formulas using the floor function](http://en.wikipedia.org/wiki/Prime_number_formulas#Formulas_using_the_floor_function)2011-12-03
  • 8
    In principle it looks OK, the summation tests for divisibility by odd numbers between $3$ and $\sqrt{N}$. The claims about Riemann hypothesis, Goldbach Conjecture, and so on are, to put it nicely, ambitious.2011-12-03
  • 2
    @AndréNicolas What claims do you refer to? Note that these formulas are simply well-known algorithms encoded into a more arithmetical programming language. This is clearer when it is made explicit, e.g. see Conway's [Fractran](http://en.wikipedia.org/wiki/FRACTRAN) language.2011-12-03
  • 4
    @Bill Dubuque: It is best not to attempt to summarize. One need only travel to the web site linked to in the main post.2011-12-03
  • 2
    Note that "a formula for the n-th prime" has never been considered an open problem. I honestly don't know why so many cranks think it is...2011-12-04
  • 0
    Page no longer exists? Vote to close.2013-08-11

1 Answers 1

7

His equations seem correct after skimming, but they are trivial and do not solve any open problem, they just an extremely roundabout and unhelpful way of stating the definitions. Stating Riemann hypothesis or twin prime conjecture is very far from proving it. He claims he proved them on "about discovery page". See Ten Signs a Claimed Mathematical Breakthrough is Wrong.

  • 0
    We're in no position to judge, I saw this on the website: "NAAS (USA) Awarded A++ = Excellent Grade to article of prime numbers formula by Prof. S.M.R.Hashemi Moosavi"2012-01-03
  • 4
    Awards prove nothing. They are mostly given for political reasons. Further, we are in a position to judge since we have the ability to think.2012-01-03
  • 0
    I think Gigili was being sarcastic.2016-09-21