Line 8: Line 8:
 
When I saw the proof of it I was pretty amazed. See image [http://upload.wikimedia.org/wikipedia/commons/9/9a/Pythagorean_proof_(1).svg here].
 
When I saw the proof of it I was pretty amazed. See image [http://upload.wikimedia.org/wikipedia/commons/9/9a/Pythagorean_proof_(1).svg here].
  
If I couldn't choose that one, I would probably choose the four color theorem, because I think it's kind of interesting since it's something people can relate to, and it's an interesting graph theory problem.
+
If I couldn't choose that one, I would probably choose the four color theorem, (<math>\forall</math> maps, <math>\exists</math> a coloring of that map that uses <math>\le 4</math> colors.) because I think it's kind of interesting since it's something people can relate to, and it's an interesting graph theory problem.

Revision as of 16:14, 27 August 2008

My favorite theorem is the Pythagorean Theorem. It is much better than EVAN'S FAVORITE THEOREM_MA375Fall2008walther.

(No seriously, I chose it before looking at his page) --

Here it is $ a^2+b^2=c^2 $

It's one of those theorems that is surprising at first. When I saw the proof of it I was pretty amazed. See image here.

If I couldn't choose that one, I would probably choose the four color theorem, ($ \forall $ maps, $ \exists $ a coloring of that map that uses $ \le 4 $ colors.) because I think it's kind of interesting since it's something people can relate to, and it's an interesting graph theory problem.

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood