The term good prime number has different meanings in mathematics. The most common uses relate to comparing a prime number with appropriate means of prime numbers from the surrounding area.
Definition according to Erdős and Straus
The nth prime number is called good if for all pairs of prime numbers and , where goes from 1 to , the following applies:
p
n
{\ displaystyle p_ {n}}
p
n
-
i
{\ displaystyle p_ {ni}}
p
n
+
i
{\ displaystyle p_ {n + i}}
i
{\ displaystyle i}
n
-
1
{\ displaystyle n-1}
p
n
2
>
p
n
-
i
⋅
p
n
+
i
.
{\ displaystyle p_ {n} ^ {2} \;> \; p_ {ni} \ cdot p_ {n + i}.}
It can be shown that there are infinitely many good prime numbers. The first of these are
5, 11, 17, 29, 37, 41, 53, 59, 67, 71, 97, ... (episode A028388 in OEIS )
This definition goes back to Paul Erdős and Ernst Gabor Straus .
Examples
Example 1:
We want to test whether 11 is a good prime number.
11 is the fifth prime number . So check:
2
,
3
,
5
,
7th
,
11
,
13
,
17th
,
19th
,
23
{\ displaystyle 2,3,5,7, \ mathbf {11}, 13,17,19,23}
11
2
=
121
>
7th
⋅
13
=
91
{\ displaystyle 11 ^ {2} = 121> 7 \ cdot 13 = 91}
11
2
=
121
>
5
⋅
17th
=
85
{\ displaystyle 11 ^ {2} = 121> 5 \ cdot 17 = 85}
11
2
=
121
>
3
⋅
19th
=
57
{\ displaystyle 11 ^ {2} = 121> 3 \ cdot 19 = 57}
11
2
=
121
>
2
⋅
23
=
46
{\ displaystyle 11 ^ {2} = 121> 2 \ cdot 23 = 46}
So 11 is a good prime number.
Example 2:
We want to test whether 13 is a good prime number.
13 is the sixth prime number . There
2
,
3
,
5
,
7th
,
11
,
13
,
17th
,
19th
,
23
,
29
,
31
{\ displaystyle 2,3,5,7,11, \ mathbf {13}, 17,19,23,29,31}
13
2
=
169
<
11
⋅
17th
=
187
{\ displaystyle 13 ^ {2} = 169 <11 \ cdot 17 = 187}
,
does not apply . Hence, 13 is not a good prime number.
13
=
p
6th
2
>
p
5
⋅
p
7th
{\ displaystyle 13 = p_ {6} ^ {2}> p_ {5} \ cdot p_ {7}}
Weaker definition
A prime number is called good if it is greater than the geometric mean of the immediately adjacent pair of prime numbers.
So the nth prime is called good if
p
n
{\ displaystyle p_ {n}}
p
n
2
>
p
n
-
1
⋅
p
n
+
1
{\ displaystyle p_ {n} ^ {2} \;> \; p_ {n-1} \ cdot p_ {n + 1}}
.
According to this definition, too, there are an infinite number of good prime numbers, the first of which are
5, 11, 17, 29, 37, 41, 53, 59, 67, 71, 79, 97, 101, ... (sequence A046869 in OEIS )
example
The 79 is a good prime number in that sense because
79
2
=
6241
>
73
⋅
83
=
6059
{\ displaystyle 79 ^ {2} = 6241> 73 \ cdot 83 = 6059}
.
But it is not a good prime number in the first sense, because it applies to the preceding pair of prime numbers
79
2
=
6241
<
71
⋅
89
=
6319
{\ displaystyle 79 ^ {2} = 6241 <71 \ cdot 89 = 6319}
.
Web links
Eric W. Weisstein : Good Prime . In: MathWorld (English).
Episode A028388 in OEIS : List of the first 10000 good prime numbers (in the first sense) on On-Line Encyclopedia of Integer Sequences
Episode A046869 in OEIS : List of the first 10,000 good prime numbers (in the second sense) on the On-Line Encyclopedia of Integer Sequences
Individual evidence
^ Richard Kenneth Guy : Good Primes and the Prime Number Graph. In: Unsolved Problems in Number Theory. 2nd Edition. Springer, New York 1994, p. 32 f, §A14. ( Google books )
formula based
Carol ((2 n - 1) 2 - 2) |
Cullen ( n ⋅2 n + 1) |
Double Mersenne (2 2 p - 1 - 1) |
Euclid ( p n # + 1) |
Factorial ( n! ± 1) |
Fermat (2 2 n + 1) |
Cubic ( x 3 - y 3 ) / ( x - y ) |
Kynea ((2 n + 1) 2 - 2) |
Leyland ( x y + y x ) |
Mersenne (2 p - 1) |
Mills ( A 3 n ) |
Pierpont (2 u ⋅3 v + 1) |
Primorial ( p n # ± 1) |
Proth ( k ⋅2 n + 1) |
Pythagorean (4 n + 1) |
Quartic ( x 4 + y 4 ) |
Thabit (3⋅2 n - 1) |
Wagstaff ((2 p + 1) / 3) |
Williams (( b-1 ) ⋅ b n - 1)
Woodall ( n ⋅2 n - 1)
Prime number follow
Bell |
Fibonacci |
Lucas |
Motzkin |
Pell |
Perrin
property-based
Elitist |
Fortunate |
Good |
Happy |
Higgs |
High quotient |
Isolated |
Pillai |
Ramanujan |
Regular |
Strong |
Star |
Wall – Sun – Sun |
Wieferich |
Wilson
base dependent
Belphegor |
Champernowne |
Dihedral |
Unique |
Happy |
Keith |
Long |
Minimal |
Mirp |
Permutable |
Primeval |
Palindrome |
Repunit ((10 n - 1) / 9) |
Weak |
Smarandache – Wellin |
Strictly non-palindromic |
Strobogrammatic |
Tetradic |
Trunkable |
circular
based on tuples
Balanced ( p - n , p , p + n) |
Chen |
Cousin ( p , p + 4) |
Cunningham ( p , 2 p ± 1, ...) |
Triplet ( p , p + 2 or p + 4, p + 6) |
Constellation |
Sexy ( p , p + 6) |
Safe ( p , ( p - 1) / 2) |
Sophie Germain ( p , 2 p + 1) |
Quadruplets ( p , p + 2, p + 6, p + 8) |
Twin ( p , p + 2) |
Twin bi-chain ( n ± 1, 2 n ± 1, ...)
according to size
Titanic (1,000+ digits) |
Gigantic (10,000+ digits) |
Mega (1,000,000+ digits) |
Beva (1,000,000,000+ positions)
Composed
Carmichael |
Euler's pseudo |
Almost |
Fermatsche pseudo |
Pseudo |
Semi |
Strong pseudo |
Super Euler's pseudo
<img src="https://de.wikipedia.org/wiki/Special:CentralAutoLogin/start?type=1x1" alt="" title="" width="1" height="1" style="border: none; position: absolute;">