What is a prime number?
A natural number greater than one cannot be written as the product of two smaller natural numbers. This simple restriction creates a unique class of integers known as prime numbers.
Questions about Prime number
Short answers, pulled from the story.
When did Euclid prove that there are infinitely many primes?
Euclid wrote Elements and proved that there are infinitely many primes around 300 BC using a clever logical argument. He showed that any finite list of primes could always be extended by multiplying them together and adding one.
Who discovered Wilson's theorem and when was it found?
Ibn al-Haytham discovered Wilson's theorem around 1000 AD while working on characterizing prime numbers. Islamic scholars later expanded this work significantly after ancient Greek mathematicians began studying these special numbers systematically.
How does public-key cryptography use prime numbers for security?
Public-key cryptography emerged publicly in the nineteen seventies and revolutionized digital security through algorithms like RSA that rely on multiplying two large primes. Breaking this code requires factoring that enormous composite back into original components without an efficient classical algorithm existing today.
When did Luke Durant discover a Mersenne prime with over forty-one million digits?
Luke Durant discovered a Mersenne prime with over forty-one million digits in October twenty-twenty-four. Modern computers have found massive primes since 1951 through distributed projects like the Great Internet Mersenne Prime Search.