News for hackers. Stuff that matters.
Re:One-sentence proof of Fermat's theorem on sums of two squ... by Grue3 on Tuesday July 26, 2016 @04:09PM (#12168419)
Not really a proof, just stating the crux of the proof. If this is considered a proof then any proof can be converted to one sentence.

For example, proof that real numbers are not countable:

If r_n is the n-th real number in [0,1) and n{k} is kth digit of n in base 3, then consider sum(3 - r_j{j})/3^j (QED)

Re:One-sentence proof of Fermat's theorem on sums of two squ... by tgb on Tuesday July 26, 2016 @04:44PM (#12168607)
I'm a grad student in math and I can say that sentences like this are quite typical in published proofs. Details are often omitted (though I just found a mistake in a paper hidden in a 'left to the reader' statement).
Re:One-sentence proof of Fermat's theorem on sums of two squ... by RossBencina on Tuesday July 26, 2016 @06:13PM (#12169110)
Obligatory links to Lamport's "How to Write a Proof" [0], and "How to Write a 21st Century Proof."[1] A video presentation of the latter is discussed at [2].

[0] http://research.microsoft.com/en-us/um/people/lamport/pubs/l...

[1] http://research.microsoft.com/en-us/um/people/lamport/pubs/p...

[2] https://news.ycombinator.com/item?id=10689391

[edit: formatting]

Re:One-sentence proof of Fermat's theorem on sums of two squ... by EGreg on Tuesday July 26, 2016 @06:56PM (#12169334)
I thought unprovable statements are usually the funniest to "leave to the reader".

Like that time someone solved an unsolved problem or two because it was on his homework:

https://en.m.wikipedia.org/wiki/George_Dantzig

Re:One-sentence proof of Fermat's theorem on sums of two squ... by fovc on Tuesday July 26, 2016 @09:47PM (#12169987)
I can't seem to find it, but I was under the impression that some famous mathematician (I had Erdos in mind, but that's clearly wrong) solved an open problem during a math olympiad in the 1950s. Perhaps that was just an tall tale our trainers would tell us, though!
Re:One-sentence proof of Fermat's theorem on sums of two squ... by pmiller2 on Wednesday July 27, 2016 @03:40AM (#12171177)
Erdős would have been nearly 40 in 1950, FYI (far too old to be competing in math olympiads).
Re:One-sentence proof of Fermat's theorem on sums of two squ... by nightcracker on Wednesday July 27, 2016 @04:57AM (#12171391)
The best method for proving theorems is proof by intimidation.
Re:One-sentence proof of Fermat's theorem on sums of two squ... by kmill on Wednesday July 27, 2016 @02:12AM (#12170862)
Speaking of uncountability, here's a similar one for why the set of functions N->{0,1} is not countable. If f:(N->{0,1})->N were a bijection, let g(t)=1-f^(-1)(t)(t), and compute g(f(g)).

Anyway, whether something counts as a proof is a matter of whether you (logically) accept it as irrefutable evidence. As with any genre, you have to consider your audience. I hear gauge theorists are content to have as a proof a couple of references to a couple papers which have techniques which apply, with minor alteration, to the current problem.

That said, I wouldn't have minded if Zagier actually demonstrated it was an involution with exactly one fixed point!