"For hundreds of years, many people have tried to prove the Four color theorem wrong. But they have all failed miserably...

 

 

Now. After countless fails.

****** comes and shows the world that he is the smartest person ever borned!!!

 

 

Yes, I have made a picture that is impossible to color all the regions using at most four colors so that no two adjacent regions have the same color.

Btw. Here is the picture

 

 

See you guys at the nobel price show thingy."

 

can someone beat it so we on anuther forum can make him be abit more... humble

Here is my solution I believe it works. Also although the four color theorem proof was controversial, I believe that it is fairly accepted in the mathematical community.

thanks mate

Was the guy saying that the interior of the square counted as a region because if so you have to do some rearranging of mine. However, it is possible.

Edited November 19, 200916 yr by DJBruce
Added New Solution.

Unless I made an error, the coloring in the attachment should be a solution. Not super easy, but I got in on the 3rd attempt.

Nqp...

From your link to wikipedia,

 

The four color theorem was proved in 1976 by Kenneth Appel and Wolfgang Haken...To dispel remaining doubt about the Appel–Haken proof, a simpler proof using the same ideas and still relying on computers was published in 1997 by Robertson, Sanders, Seymour, and Thomas. Additionally in 2005, the theorem was proven by Georges Gonthier with general purpose theorem proving software.

 

SFN - 101, Impossible - 0

 

From your link to wikipedia,

 

*his link