Four color theorem: first theorem proved using computer

       

         Four Colour Theorem

"First ever theorem proved using computer"

Statement: To colour a map at most 4 colours are required

•Condition:
Adjacent state & country must have different colour.

<

See sol. Below

Look only 4 colours are used...

Real story :

 In 1852 while colouring  the map of England Francis Guthrie noticed that only 4 colours were required to colour map so that no adjacent countries have same colour. He then asked this problem from his brother who was student at university of college ,London .Even his brother didn't know the answer so he presented this problem to his mathematics teacher De Morgan ;still no answer .....
thus resulted in the most debated question of the 19th  century.

But 4 colour is enough to colour any map.???

It took 150 yrs to solve  this problem.
In 1976,this problem is solved by Hacken & Appel using a computer.

Consider a map ..

Challenge Time!!


Now click the below button & try to make a map like above.
 Prove it wrong that only 4 colours are required.

For any queries comment below