I haven't seen people talk about this at all, so thought I'd share this article about it. For those depressed that no one will actually understand the RH Proof: we have another, entirely human proof which means there are humans who understand it. It might have been overshadowed, but assuming it ends up working out (I have heard there have been some problems found, hopefully they are surmountable) then I think it will be the far more impactful result.

you are viewing a single comment's thread
view the rest of the comments
[–] 25 points 5 hours ago (8 children)
  1. LEAN is a math programming language with automatic checking
  2. The hypothesis is an algorithm which predicts prime numbers out to infinity
  3. It is not guaranteed that the algorithm works until infinity
  4. This has been unsolved for 138 years
  • source
  • parent
  • hideshow 8 child comments
  • [–] 5 points 4 hours ago (5 children)

    Thanks! For #3, how can you prove that it works until infinity if infinity doesn’t end?

  • source
  • parent
  • hideshow 5 child comments
  • [–] 12 points 4 hours ago* (1 child)

    Do you believe that n+1>n no matter how big n is?

    You'd prove this above using induction, and I don't know how the openai proof was written, just giving you an idea of how one goes around writing something like that

  • source
  • parent
  • hideshow 1 child comment
  • [–] 0 points 2 hours ago* (last edited 2 hours ago)

    I don't think #3 is correct. There's no such thing as "until infinity".

    But there are many ways to prove properties of infinite sets. For example I immediately think of proof by induction. And there are other options. You can generalize over all elements using common properties. "Prove that every nonzero real number x has a multiplicative inverse." (Bad example but you get the point.)

  • source
  • parent
  • [–] 2 points 2 hours ago (1 child)

    The hypothesis is an algorithm which predicts prime numbers out to infinity

    It's not really predicting primes... Copying from a google search: "primes appear with minimal irregular fluctuations around their smooth average trend."

  • source
  • parent
  • hideshow 1 child comment
  • It can predict primes in an incredibly inefficient way.. The zeta function would require more compute to predict primes than a sieve that was discovered 2300 years ago. What it is useful for is to show statistically how the primes are distributed.

  • source
  • parent