Primality of primes
Are there infinite primes?
Euclid proved that there are infinite number of prime numbers. Simplest form of the proof is as follows. Assume there are N prime numbers. If you multiply all those numbers and add 1, you get Euclid's number. This number is not divisible by any of the primes. Therefore it is either a prime or divisible by one of the primes which was not included in the set N. It concludes that there must be N + 1 primes. Hence resulting in infinite number of primes.
How are they distributed?
The next interesting question is how these primes are distributed. UTM has more details on the distribution of primes.
What is the current largest prime known?
The largest known prime, as of December 2005, is 2^(30402457) − 1 (this number is 9,152,052 digits long); it is the 43rd known Mersenne prime. M30402457 was found on December 15, 2005 by Curtis Cooper and Steven Boone, professors at Central Missouri State University and members of a collaborative effort known as GIMPS. Before finding the prime, Cooper and Boone ran the GIMPS program on a peak of 700 CMSU computers for 9 years. (Source: wikipedia)
Where are the prime numbers used?
They are widely used in cryptography, pseudo random number generators and hash tables.
Primality proving algorithms:
Three indian scientists Manindra Agrawal, Neeraj Kayal and Nitin Saxena of IIT Kanpur came up with an algorithm known as AKS primality test to prove the primality of a number. It is the first algorithm which guarantees the distinction between a prime and composite number. It runs in polynomial time.
