News for hackers. Stuff that matters.
Re:Mathematical embarrassments are problems that should be s... by bumbledraven on Sunday December 27, 2009 @10:56PM (#1018059)
My favorite mathematical embarassment: what is the chromatic number of the plane? That is, what is the minimum number of colors needed to color each point in the plane such that no two points that are a distance of 1 apart are the same color? It is known that the answer is 4, 5, or 6.
Re:Mathematical embarrassments are problems that should be s... by roundsquare on Monday December 28, 2009 @12:58AM (#1018171)
I believe the 5 color map theorem is proved.

http://en.wikipedia.org/wiki/Five_color_theorem

As far as I know, there is a "proof" of the 4 color map theorem, but it requires the use of a computer to analyze about a 1,000 different scenarios, so its hard to check, unintuitive, and "not elegant."

Re:Mathematical embarrassments are problems that should be s... by mquander on Monday December 28, 2009 @03:05AM (#1018316)
This is not the problem described by the post you are responding to. Search for "chromatic number of the plane" or "Hadwiger-Nelson problem" to find clarification.