What about the classification of finite simple groups?
-
-
-
That’s another good contender. Somewhat longer statement; much longer proof.
- 6 more replies
New conversation -
-
-
Isn't it that no 3 positive integers can match a^n+b^n=c^n if n>2? I guess it had infinite solutions for n=1 and n=2
-
That’s accurate (integer n, of course). It’s trivial for n=1 (a+b=c); n=2 is just Pythagorean triples, of which there are infinitely many.
- 3 more replies
New conversation -
-
-
I suspect the odd-order theorem's ratio is lower. Over 200 pages to prove "every finite group with odd order is solvable."
-
(Obviously much depends on what level of jargon you accept in the theorem statement. The ratio probably can't be unambiguously defined)
- 1 more reply
New conversation -
-
-
(Obviously much depends on what level of jargon/background you accept in the theorem statement)
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
And thd ABC conjecture? If counted as a proof of course.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Marginal yet not so marginal!
#FermatLastTheorem :DThanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
hasn't Fermat said himself that the proof is trivial? so why should we settle with 129 pages?
-
Everything was trivial in the eyes of Fermat. Fermat was the french Ramanujan.
- 1 more reply
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.