Sophie Germain prime: Difference between revisions

Revision as of 23:49, 21 April 2009

This article defines a property that can be evaluated for a prime number. In other words, every prime number either satisfies this property or does not satisfy this property.
View other properties of prime numbers | View other properties of natural numbers

Definition

A Sophie Germain prime is a prime number $p$ such that $2p+1$ is also prime. The corresponding prime $2p+1$ is termed a safe prime.

Occurrence

Infinitude conjecture

Further information: Infinitude conjecture for Sophie Germain primes

It is conjectured that there are infinitely many Sophie Germain primes (or equivalently, that there are infinitely many safe primes). It is also conjectured that the number of Sophie Germain primes less than or equal to $n$ is $O(n/\log ^{2}n)$ , in other words, there exist constants $a,b$ such that the following holds for all sufficiently large $n$ :

${\frac {an}{\log ^{2}n}}\leq \pi _{SG}(n)\leq {\frac {bn}{\log ^{2}n}}$ .

where $\pi _{SG}(n)$ denotes the number of Sophie Germain primes less than or equal to $n$ .

Infinitude of complement

Most primes are not Sophie Germain primes. It is rather easy to see that the number of primes that are not Sophie Germain primes is infinite: for instance, there are infinitely many primes that are $1$ modulo $3$ , and none of them can be a Sophie Germain prime.

Facts

While there are not too many interesting facts about the structure of Sophie Germain primes per se, the structure of the corresponding safe primes is very interesting:

Testing

The ID of the sequence in the Online Encyclopedia of Integer Sequences is A005384

@@ Line 5: / Line 5: @@
 A '''Sophie Germain prime''' is a [[prime number]] <math>p</math> such that <math>2p + 1</math> is also prime. The corresponding prime <math>2p + 1</math> is termed a [[safe prime]].
+==Occurrence==
+===Infinitude conjecture===
+{{further|[[Infinitude conjecture for Sophie Germain primes]]}}
+It is conjectured that there are infinitely many Sophie Germain primes (or equivalently, that there are infinitely many [[safe prime]]s). It is also conjectured that the number of Sophie Germain primes less than or equal to <math>n</math> is <math>O(n/\log^2 n)</math>, in other words, there exist constants <math>a,b</math> such that the following holds for all sufficiently large <math>n</math>:
+<math>\frac{an}{\log^2 n} \le \pi_{SG}(n) \le \frac{bn}{\log^2 n}</math>.
+where <math>\pi_{SG}(n)</math> denotes the number of Sophie Germain primes less than or equal to <math>n</math>.
+===Infinitude of complement===
+Most primes are ''not'' Sophie Germain primes. It is rather easy to see that the number of primes that are not Sophie Germain primes is infinite: for instance, there are infinitely many primes that are <math>1</math> modulo <math>3</math>, and none of them can be a Sophie Germain prime.
+==Facts==
+While there are not too many interesting facts about the structure of Sophie Germain primes ''per se'', the structure of the corresponding [[safe prime]]s is very interesting:
+* [[Quadratic nonresidue that is not minus one is primitive root for safe prime]]
+* [[Safe prime has plus or minus two as primitive root]]
 ==Testing==
 {{oeis|A005384}}