Safe prime: Difference between revisions
No edit summary |
|||
| Line 16: | Line 16: | ||
===Related properties of longer chains of primes=== | ===Related properties of longer chains of primes=== | ||
* [[Cunningham chain]] is a chain of primes <math>q_1 < q_2 < \dots < q_k</math> such that <math>q_{i+1} = 2q_i + 1</math>. | * [[Cunningham chain of the first kind]] is a chain of primes <math>q_1 < q_2 < \dots < q_k</math> such that <math>q_{i+1} = 2q_i + 1</math>. | ||
* [[Bitwin chain]] is a collection of multiple pairs of twin primes, each pair being double the previous one. | * [[Bitwin chain]] is a collection of multiple pairs of twin primes, each pair being double the previous one. | ||
Revision as of 22:14, 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 prime number is termed a safe prime if is odd and is also a prime number.
The corresponding prime is termed a Sophie Germain prime.
Relation with other properties
Related properties of primes or pairs of primes
- Sophie Germain prime is a prime such that is also a prime.
- Twin primes are primes that differ by two.
Related properties of longer chains of primes
- Cunningham chain of the first kind is a chain of primes such that .
- Bitwin chain is a collection of multiple pairs of twin primes, each pair being double the previous one.