Prime numbers are whole numbers greater than 1 that are not divisible by any whole number other than 1 and itself. The first few are 2, 3, 5, 7, 11, 13 … To explain how the RSA algorithm works ...

UCLA mathematicians appear to have won a $100,000 prize from the Electronic Frontier Foundation for discovering a 13-million-digit prime number that has long been sought by computer users.

Fortunately, Édouard Lucas developed a prime number test in 1878, later proved by Derrick Henry Lehmer in 1930. Their work resulted in an efficient algorithm for evaluating potential Mersenne ...

Prime numbers have captivated mathematicians for thousands of years—and now cloud computing is helping them chase the biggest ones yet.

An online collective, the Great Internet Mersenne Prime Search, crunched numbers for days on end to discover a new prime number in December 2017. Here’s why it’s so important.

He was the first to find a pattern in how prime numbers occurred, and even has a type of prime number named after him, from which the image above is entirely drawn.

Today, people use complex computing networks to search for prime numbers with millions of digits. But early mathematicians were running these calculations by hand.