[HN Gopher] A Formal Proof of Complexity Bounds on Diophantine E...
       ___________________________________________________________________
        
       A Formal Proof of Complexity Bounds on Diophantine Equations
        
       Author : badmonster
       Score  : 37 points
       Date   : 2025-05-23 20:09 UTC (2 hours ago)
        
 (HTM) web link (arxiv.org)
 (TXT) w3m dump (arxiv.org)
        
       | badmonster wrote:
       | impressive formalization effort that bridges deep number theory
       | and formal methods
        
       | btilly wrote:
       | I found https://x.com/gm8xx8/status/1925768687618773079 to be a
       | little more understandable summary of what was actually shown.
       | 
       | Any Diophantine equation can be reduced to one of at most 11
       | variables and degree at most around 10^63. No algorithm can
       | decide solvability in rational numbers for this class of
       | Diophantine equations.
        
       | kevinventullo wrote:
       | A mind-blowing consequence of the MRDP theorem is that there is a
       | multi-variate polynomial which fits on a sheet of paper with the
       | property that the values of the first variable which appear in
       | integer solutions are exactly the set of prime numbers.
       | 
       | https://en.wikipedia.org/wiki/Formula_for_primes#Formula_bas...
        
       ___________________________________________________________________
       (page generated 2025-05-23 23:00 UTC)