Difference between revisions of "Prime number"

Revision as of 21:07, 14 June 2019

A prime number (or simply prime) is a positive integer $p>1$ whose only positive divisors are 1 and itself. Note that $1$ is usually defined as being neither prime nor composite because it is its only factor among the natural numbers.

There are an infinite number of prime numbers. A standard proof attributed to Euclid notes that if there are a finite set of prime numbers $p_1, p_2, \ldots, p_n$ , then the number $N = p_1p_2\cdots p_n + 1$ is not divisible by any of them, but $N$ must have a prime factor, which leads to a direct contradiction.

Techniques to Check for Prime Numbers

Divisibility

A prime number is only divisible by one or itself, so a number $n$ is prime if and only if $n$ is not divisible by any integer greater than $1$ and less than $n$ . One only needs to check integers up to $\sqrt{n}$ because dividing larger numbers would result in a quotient smaller than $\sqrt{n}$ .

Modular Arithmetic

Modular arithmetic can help determine if a number is not prime.

If a number not equal to $2,3$ is congruent to $0,2,3,4,6 \pmod{6}$ , then the number is not prime.
If a number not equal to $2,5$ ends with an even digit or $5$ , then the number is not prime.

Sieve of Eratosthenes

Main article: Sieve of Eratosthenes

The Sieve of Eratosthenes is a relatively simplistic algorithm for generating a list of the first few prime numbers. It is a method in which the multiples of all known primes are labeled as composites, and subsequently crossed out, starting with multiples of two, then three, then five, and so on. For example, circle 2, and cross out all other multiples of two. Then circle 3, and cross out all multiples of three. Repeat with all other prime numbers as needed. Although simple to understand, it is inefficient for finding large primes.

Importance of Primes

According to the Fundamental Theorem of Arithmetic, there is exactly one unique way to factor a positive integer into a product of primes (permutations not withstanding). This unique prime factorization plays an important role in solving many kinds of number theory problems.

Famous Primes

Fermat Primes

A Fermat prime is a prime of the form $2^n+1$ . It can easily be shown that for such a number to be prime, n must not have any odd divisor larger than 1 and so must be a power of 2. Therefore all Fermat primes have the form $2^{2^n}+1$ . Fermat checked the cases $n=0,1,2,3,4$ and conjectured that all such numbers of the form were prime. However, $2^{2^5}+1=641\cdot 6700417$ . $n$ also fails if $n = 6$ ; $2^{2^6} + 1 = 274177\cdot 67280421310721$ . In fact, no other Fermat primes have been found to date.

There is an easy proof of the infinitude of primes based on Fermat numbers (numbers of the form $2^{2^n} + 1$ ). Just show that any two Fermat numbers are relatively prime.

Mersenne Primes

A Mersenne prime is a prime of the form $2^n-1$ . For such a number to be prime, n must itself be prime. Compared to other numbers of comparable sizes, Mersenne numbers are easy to check for primality because of the Lucas-Lehmer test, severely reducing the amount of computation needed.

Twin Primes

Two primes that differ by exactly 2 are known as twin primes. The following are the first few pairs of twin primes:
3, 5
5, 7
11, 13
17, 19
29, 31
41, 43

It is not known whether or not there are infinitely many pairs of twin primes. This is known as the Twin Prime Conjecture, which is a specific instance of the Hardy-Littlewood conjecture.

Gaussian Primes

A Gaussian prime is a prime that extends the idea of the traditional prime to the Gaussian integers. One can define this term for any ring, especially number rings.

Advanced Definition

When the need arises to include negative divisors, a prime is defined as an integer p whose only divisors are 1, -1, p, and -p. More generally, if R is an integral domain, then a nonzero element p of R is a prime if whenever we write $p=ab$ with $a,b\in R$ , then exactly one of a and b is a unit.

@@ Line 4: / Line 4: @@
 There are an infinite number of prime numbers. A standard proof attributed to [[Euclid]] notes that if there are a finite set of prime numbers <math>p_1, p_2, \ldots, p_n</math>, then the number <math>N = p_1p_2\cdots p_n + 1</math> is not divisible by any of them, but <math>N</math> must [[#Importance of Primes|have]] a prime factor, which leads to a direct contradiction.
-== Identifying primes ==
+== Techniques to Check for Prime Numbers ==
+===Divisibility===
+A prime number is only divisible by one or itself, so a number <math>n</math> is prime if and only if <math>n</math> is not divisible by any integer greater than <math>1</math> and less than <math>n</math>.  One only needs to check integers up to <math>\sqrt{n}</math> because dividing larger numbers would result in a quotient smaller than <math>\sqrt{n}</math>.
+===Modular Arithmetic===
+Modular arithmetic can help determine if a number is not prime.
+* If a number not equal to <math>2,3</math> is congruent to <math>0,2,3,4,6 \pmod{6}</math>, then the number is not prime.
+* If a number not equal to <math>2,5</math> ends with an even digit or <math>5</math>, then the number is not prime.
+===Sieve of Eratosthenes===
 {{main|Sieve of Eratosthenes}}
 The [[Sieve of Eratosthenes]] is a relatively simplistic [[algorithm]] for generating a list of the first few prime numbers. It is a method in which the multiples of all known primes are labeled as composites, and subsequently crossed out, starting with multiples of two, then three, then five, and so on.

Page

Toolbox

Search