How is it possible to identify a prime number when it has hundreds of digits? Unresolved is the question that many mathematicians asked and few dared to answer. An Indian mathematician was the brave resolve was raised and it has: Manindra Agrawal, professor of Institute of Technology India has discovered a mathematical formula as an algorithm to recognize prime numbers. Now the brightest minds in the world face a new challenge: to improve the algorithm and eliminate enormous margin of error.Los primes are among the most complex mathematical phenomena because they do not have a definite pattern, displayed in a manner not easily recognizable. Prime numbers such as 2, 5 or 7 itself can be identified as prime numbers, because they are not divisible by any other number except 1 and themselves. But what happens with the largest numbers? It is very easy to determine if a reasonably small number is prime, but not so simple when talking about a number with, say, 300 digits. Very large prime numbers are essential in computer software for security and encryption applications. But apart from commercial applications, these numbers have always fascinated mathematicians. After several false starts over the past three years, Agrawal and two of his students Neeraj Kayal and Nitin Saxena, finally solved the riddle: an algorithm is key to recognizing primes. Solve these problems, and computers, much faster than the best minds on the planet. But computers also break down and they are wrong. The call of Agrawal Agrawal's achievement was the discovery that an algorithm can identify a very long prime number and error free. Nobody knew anything about the ingenious solution of this Indian mathematician until Agrawal sent his report via email to other mathematicians for help. Needed to refine and improve their find. Hendrik Lenstra, a professor of mathematics at the University of California, Berkeley, (USA) was one of the scientists who received the mail. Lenstra has recognized some scientific publications at first believed that the discovery of an unknown mathematician of India made no sense. A few minutes of retraining made Lenstra started taking the e-mail very seriously. In a couple of days, Lenstra Agrawal sent a simplified version of their algorithm. The problem of the original algorithm was its small margin of error. Although the ideas of Lenstra managed to reduce the margin, Agrawal concluded that the improved algorithm was "impracticable." These algorithms, improved, offer great potential because they recognize prime numbers much faster and without the possibility of errors. But the simplified version Lenstra still premature. Must be corrected. Many other mathematicians are working on the problem. Agrawal believes that the activity of the scientists who have been involved in this great enigma, in less than a year will see some improvements. From the moment he distributed his report, Agrawal received recognition and applause from many colleagues from different countries. The fact that this discovery may have or no market value Agrawal no worries because he has given renewed hope to the scholars of the mathematical mysteries. The largest-known prime number has four million digits. Its formula may be key to ending a mathematical problem as it was that no one solution. And global competition has begun to improve the original algorithm. Who will win?
0 comments:
Post a Comment