I Thought it was still a OPEN Problem!

To the amazing fact that the problem of finding whether a given number is prime or not was thought by me to be a open problem. For reference just search the internet. A good source of discussion is Prof. Donald Knuth's landmark text book, "The Art of Computer Programming." This is available for purchase at Amazon.com or Firstandsecond.com (for Indians).

I thought till this minute it was open. Indians (Hip! Hip! Hurray!) have solved the problem. Students and professor of IITK/CSE department have together solved this problem.

What is this problem? "To find whether a given number n is prime or not by an Algorithm." This is the primary problem, but to add proficiency to it; we have to look into an associated problem, whether the problem is solvable in Polynomial time.

Till date I thought it was a trans-computational problem. But the amazing fact is that it has been solved in the year 2002 by Prof. Manidra Agarwal and two of his students, Nitin Saxena and Neeraj Kayal. These student will, I think, bring India's part in Galileo's idea one step further. But how is it possible? Yes, these students are forming another gemstone in the necklace to India, They have enrolled for Ph.D. at IITK. So, we still have hope to march along with the world with our heads high. (don't understand! View my post titled Galileo & INDIA just below.)

The "Prime is in P" paper is available online. Before u try to view the contents of the paper, or try reading it, please find the amazing facts about the problem. The more you have the feel about the problem, the more you start liking it and more better it is to enjoy the fruition.