← Back to context

Comment by bananaflag

9 hours ago

I am really interested in whether AI will find a significantly easier (1920 level or so) proof of FLT.

It seems unlikely to find 1920 level or so proof although it might be the case that a significantly easier/shorter proof exits via Vandiver conjecture + extra work or Effective Mordell conjecture but it also wouldn't surprise me if that would be even more complicated than the current proof of FLT.