December 31, 2007
CMYK should be fine
PlayThis map lead to a conjecture in graph theory in 19th century which till now has not been proved “properly”. Although computerized exhaustive search proofs exist, mathemeticians reject it by calling it a “telephone directory” and they want the proof to be a “poem”.
Identify the conjecture/theorem/problem.
Happy New Year!
Cracked by: udupendra(Congratulations on scoring a century!) , jayanth , madhur , Dibyo , shenoyvarun86 , sumanth , sidsen , Ranjana Ninan , Shreyas , Keerthi , VikraM , piezocake , BiGFooT , nishas thambi , Gammafunction , prasanth , yaksha , Poornima , bobo , shashank and Arjun Chennu.
Answer:
Quoting Arjun Chennu,
This is the Four Colour Problem identified by Francis Guthrie in 1852, when it was ‘discovered’ that any map could be colored using 4 colors such that adjacent segments received different colors.
Subscribe
Play
Head 2 Head
this->bb();
It is often the case that using only three colors is inadequate. This applies already to the map with one region surrounded by three other regions (although with an even number of surrounding countries three colors are enough) and it is not at all difficult to prove that five colors are sufficient to color a map.
The four color theorem was the first major theorem to be proven using a computer, and the proof is not accepted by all mathematicians because it would be unfeasible for a human to verify by hand (see computer-assisted proof). Ultimately, in order to believe the proof, one has to have faith in the correctness of the compiler and hardware executing the program used for the proof.
The perceived lack of mathematical elegance by the general mathematical community was another factor, and to paraphrase comments of the time, “a good mathematical proof is like a poem—this is a telephone directory!”
happy new year! *hic*
Its(the proof) not a poem because it is highly impossible to prove by actually colouring a region by hand
Its a telephone directory because no one can verify a directory,one can just believe it..
The conjecture was proposed by Francis Guthrie while trying to color the map of england.
A very happy new year to all of you here at Boiledbeans!
The theorem states that any plane separated into regions, such as a map of countries or states, can be colored with only four colors, such that no adjacent regions have the same color.