Famous Conjectures

< 32.5 Bridges of Konigsberg | Topic Index | 32.7 Srinivasa Ramanujan >

Conjecture, Proof & Counter Examples are 3 powerful ideas in math.

Math is a way of thinking and mathematicians think of a lot of connections &amp; relations between numbers and shapes. The idea of the Pythagoras Theorem which connects all three sides of a right-angled triangle through areas is one such example. But the theorem could be proved to the satisfaction of all mathematicians. But some other such ideas were proved wrong also. Conjectures are ideas which have not yet been proved!

What is a mathematical proof? It is a series of statements tied together by rigorous math logic. Every step should be logically derivable from the previous step. To say that a conjecture holds good for a few numbers or even a million numbers is not good enough.

If the process of trying to prove a conjecture yields even a single counterexample, then the conjecture is not valid anymore! Such an example is called a counterexample because it's an example that counters, or goes against, the statement's conclusion.

Some of the unproved conjectures in math are world-famous. They are also simple enough that the problem itself can be understood by students of primary school! Let us see some of them.

Collatz Conjecture

This number series was discovered in 1937 by Lother Collatz. But till today no one has been able to prove why the numbers behave as they do. It is considered the simplest unsolved problem in mathematics.
 * 1) Write down a number (in initial stages write a small number to get practice)
 * 2) Work out the next number as per the following rules 				If the number is even, then divide it by 2If the number is odd then multiply it by 3 and add one. In short find 3n+1
 * 3) Write down the next number below the previous number
 * 4) Repeat steps 2 &amp; 3 until you come to a surprising end.

Four Color Theorem

All of us know about the political map of a country or a state which has been divided into smaller areas like states or districts. If we want each of the smaller divisions to be visible clearly, we colour each area with a different colour. No two divisions which share a common border should have the same colour. What is the minimum number of colours required?

In 1852, a college student in London, wondered if 4 was the number. Many people who tried with different kinds of maps, also came up with the answer 4. But till today there is no mathematical proof that the minimum number of colours for colouring any map is 4!

With the invention of computers, many tried to solve the problem with a computer. In 1976, a computer worked out that there were only 1936 different kinds of maps and each of them requires only 4 colours.

But math being what it is, the computer proof was not accepted and the world is still waiting for a mathematical proof!

Goldbach Conjecture

In 1742, Christian Goldbach conjectured that every even number greater than 2, can be written as a sum of 2 prime numbers.

With computers, mathematicians have been able to show that this conjecture is true for all numbers up to!

But as in the case of the Four-Color Theorem, the computer proof was not accepted, and the world is still waiting for a mathematical proof!

Twin Prime Conjecture

We know that all primes are odd numbers. Two consecutive odd numbers which are also primes are called Twin Primes. Some examples are 5 &amp; 7, 17 &amp; 19, 29 &amp; 31 etc.

Euclid proved that the number of primes is infinite. Mathematicians have been trying to see if Twin Primes are also infinite. Though this is believed to be true, no one has been able to prove it.

Just for interest, the largest twin primes discovered till today are

2,003,663,613X2195,000and 2,003,663,613X2195,000 + 1  which have 58711 digits!

< 32.5 Bridges of Konigsberg | Topic Index | 32.7 Srinivasa Ramanujan >