## Prime numbers
One easy way to tell whether a number is prime is to try dividing it by all numbers up to its square root. If there are no divisors up to its square root, it is prime. However, for primes with hundreds of digits, this is incredibly slow and cumbersome. Faster methods exist. Some methods are especially fast for certain types of primes. However, there are an infinite number of primes. A proof was shown by Euclid. Suppose you have a finite list of primes. Multiply them all together. This new number is divisible by all primes. Now add 1 to get a number not divisible by any primes in our list. Thus it is either composite and has a prime factor not on our list or is prime and is not on our list. Either way, there is a prime number not on our list. There are many types of prime numbers. Twin primes are primes that are in a pair. A pair of twin primes must have a difference of 2. For example, 41 and 43 are twin primes. Twin primes are much rarer than other primes. In fact, we do not know if there are infinitely many of them. The twin primes conjecture states that there are infinitely many twin primes. Other types of primes exist. There are the Mersenne primes, which are
2 There are many more conjectures. Goldbach's conjecture states that every
even number greater than 2 is the sum of two prime numbers. No one has
proved this yet and it seems incredibly difficult to prove. We do know
that all even numbers are either the sum of two primes or the sum of a
prime and the product of two other primes. Also, there is the Euclid-Mullin
conjecture. First create a list starting with 2. The next term is the
least prime factor of one more than the product of all terms so far. The
list goes: 2, 3, 7, 43, 13, 53, 5, 6221671... The conjecture posed by
Mullin in 1963 was whether all primes appear in this list. It is also
named after Euclid as the list is constructed using his method to prove
that there are infinitely many primes. ## Related entries•Prime Problems | ||

Home • Contact |