News for hackers. Stuff that matters.
Re:A very old problem turns 20 by Someone on Monday June 24, 2013 @07:55PM (#5936548)
As others said, once you have sufficient terminology, the proof is simple.

For the Ruffini theorem, http://math.stackexchange.com/questions/286927/why-cant-ther... states:

"The reason five is special is that the group A5 of all even permutations of 5 letters is the smallest non-abelian simple group".

An example from computer science that some may understand better: A monad is just a monoid in the category of endofunctors.

Both are short statements that one cannot grasp without prior knowledge, but that become simple once one has 'some' prior knowledge.

And in some sense, it is turtles all the way down. Even the statement 1+1=2, when studied deeply enough, requires huge amounts of prior knowledge (about 380 pages, and that excludes the definition of 'addition' (http://en.wikipedia.org/wiki/Principia_Mathematica#Quotation...) :-))

Some say that there are three kinds of theorems: false, trivial and not yet trivial.

There are no comments on this comment yet.