Weak primes (Engl. Weakly Prime Numbers or digital Delicate Prime ) are prime numbers , which always lose in case of change of any single digit in any other figure their prime property. As a weak prime numbers (Engl. Weak Prime ) but also for encryption called improper primes.
Examples
The prime number is a weak prime number because:
p
=
294001
{\ displaystyle p = 294001}
If you change just one of the six digits, you only get composite numbers, which are therefore not prime numbers:
0 94001, 1 94001, 3 94001, 4 94001, 5 94001, 6 94001, 7 94001, 8 94001, 9 94001
2 0 4001, 2 1 4001, 2 2 4001, 2 3 4001, 2 4 4001, 2 5 4001, 2 6 4001, 2 7 4001, 2 8 4001
29 0 001, 29 1 001, 29 2 001, 29 3 001, 29 5 001, 29 6 001,, 29 7 001, 29 8 001, 29 9 001
294 1 01, 294 2 01, 294 3 01, 294 4 01, 294 5 01, 294 6 01, 294 7 01, 294 8 01, 294 9 01
2940 1 1, 2940 2 1, 2940 3 1, 2940 4 1, 2940 5 1, 2940 6 1, 2940 7 1, 2940 8 1, 2940 9 1
29400 0 , 29400 2 , 29400 3 , 29400 4 , 29400 5 , 29400 6 , 29400 7 , 29400 8 , 29400 9
Overall, in this case one has to examine numbers to see if they are composite numbers.
9
⋅
6th
=
54
{\ displaystyle 9 \ cdot 6 = 54}
The first weak prime numbers are:
294001, 505447, 584141, 604171, 971767, 1062599, 1282529, 1524181, 2017963, 2474431, 2690201, 3085553, 3326489, 4393139, 5152507, 5564453, 5575259, 6173731, 6191371, 67327179, 7412679, 6191371, 62327179, 7412679, 6732769, 7412679789, 67327179, 741269789, 67327179, 7412679789, 67327179, 741269789, 67327179, 74126797 ... (Follow A050249 in OEIS )
The largest currently known weak prime is (as of December 10, 2018):
17th
⋅
10
1000
-
17th
99
+
21686652
=
17th
...
1738858369
{\ displaystyle {\ frac {17 \ cdot 10 ^ {1000} -17} {99}} + 21686652 = 17 \ ldots 1738858369}
This number has 496 , which are directly behind each other, it has digits and was discovered in March 2007 by Jens Kruse Andersen.
17th
{\ displaystyle 17}
1000
{\ displaystyle 1000}
properties
In order to determine whether a -digit prime number is a weak prime number, one must control numbers, whether they are compound or not. Only when all the numbers are put together is the -digit prime number actually a weak prime. (see example above)
k
{\ displaystyle k}
9
⋅
k
{\ displaystyle 9 \ cdot k}
9
k
{\ displaystyle 9k}
k
{\ displaystyle k}
There are infinitely many weak prime numbers.
Proof: see by Terence Tao from 2011.
Weak prime numbers in other number systems
The above section dealt with weak prime numbers in the decimal system , i.e. the base .
b
=
10
{\ displaystyle b = 10}
A prime number is a weak prime number for the base if it always loses its prime number property when any single digit is changed to any other digit (written in the base ).
p
∈
P
{\ displaystyle p \ in \ mathbb {P}}
b
{\ displaystyle b}
p
{\ displaystyle p}
b
{\ displaystyle b}
Examples of weak prime numbers in other number systems
The prime number is a weak base prime because:
p
=
436
7th
=
4th
_
⋅
7th
2
+
3
_
⋅
7th
1
+
6th
_
⋅
7th
0
=
196
+
21st
+
6th
=
223
{\ displaystyle p = 436_ {7} = {\ underline {4}} \ cdot 7 ^ {2} + {\ underline {3}} \ cdot 7 ^ {1} + {\ underline {6}} \ cdot 7 ^ {0} = 196 + 21 + 6 = 223}
b
=
7th
{\ displaystyle b = 7}
If you change one of the three digits in the base , you only get composite numbers, which are therefore not prime numbers:
b
=
7th
{\ displaystyle b = 7}
0 36 7 , 1 36 7 , 2 36 7 , 3 36 7 , 5 36 7 , 6 36 7
4 0 6 7 , 4 1 6 7 , 4 2 6 7 , 4 4 6 7 , 4 5 6 7 , 4 6 6 7
43 0 7 , 43 1 7 , 43 2 7 , 43 3 7 , 43 4 7 , 43 5 7
Overall, the above list gives composite numbers.
6th
⋅
3
=
24
{\ displaystyle 6 \ cdot 3 = 24}
Representing all of the above 24 numbers, the number is checked for its primality:
433
7th
{\ displaystyle 433_ {7}}
433
7th
=
4th
_
⋅
7th
2
+
3
_
⋅
7th
1
+
3
_
⋅
7th
0
=
196
+
21st
+
3
=
220
∉
P
{\ displaystyle 433_ {7} = {\ underline {4}} \ times 7 ^ {2} + {\ underline {3}} \ times 7 ^ {1} + {\ underline {3}} \ times 7 ^ { 0} = 196 + 21 + 3 = 220 \ not \ in \ mathbb {P}}
is not a prime number. Checking all other 23 numbers above works in the same way.
The following table shows the smallest weak prime numbers for the base (sequence A186995 in OEIS ):
b
≤
16
{\ displaystyle b \ leq 16}
Base
b
{\ displaystyle b}
weak primes to the base , written to the base
b
{\ displaystyle b}
b
{\ displaystyle b}
Conversion into the decimal system
1
11
1
{\ displaystyle 11_ {1}}
1
_
⋅
1
1
+
1
_
⋅
1
0
=
1
+
1
=
2
{\ displaystyle {\ underline {1}} \ cdot 1 ^ {1} + {\ underline {1}} \ cdot 1 ^ {0} = 1 + 1 = 2}
2
1111111
2
{\ displaystyle 1111111_ {2}}
1
_
⋅
2
6th
+
1
_
⋅
2
5
+
1
_
⋅
2
4th
+
1
_
⋅
2
3
+
1
_
⋅
2
2
+
1
_
⋅
2
1
+
1
_
⋅
2
0
=
64
+
32
+
16
+
8th
+
4th
+
2
+
1
=
127
{\ displaystyle {\ underline {1}} \ cdot 2 ^ {6} + {\ underline {1}} \ cdot 2 ^ {5} + {\ underline {1}} \ cdot 2 ^ {4} + {\ underline {1}} \ times 2 ^ {3} + {\ underline {1}} \ times 2 ^ {2} + {\ underline {1}} \ times 2 ^ {1} + {\ underline {1}} \ cdot 2 ^ {0} = 64 + 32 + 16 + 8 + 4 + 2 + 1 = 127}
3
2
3
{\ displaystyle 2_ {3}}
2
_
⋅
3
0
=
2
{\ displaystyle {\ underline {2}} \ cdot 3 ^ {0} = 2}
4th
11311
4th
{\ displaystyle 11311_ {4}}
1
_
⋅
4th
4th
+
1
_
⋅
4th
3
+
3
_
⋅
4th
2
+
1
_
⋅
4th
1
+
1
_
⋅
4th
0
=
256
+
64
+
48
+
4th
+
1
=
373
{\ displaystyle {\ underline {1}} \ cdot 4 ^ {4} + {\ underline {1}} \ cdot 4 ^ {3} + {\ underline {3}} \ cdot 4 ^ {2} + {\ underline {1}} \ times 4 ^ {1} + {\ underline {1}} \ times 4 ^ {0} = 256 + 64 + 48 + 4 + 1 = 373}
5
313
5
{\ displaystyle 313_ {5}}
3
_
⋅
5
2
+
1
_
⋅
5
1
+
3
_
⋅
5
0
=
75
+
5
+
3
=
83
{\ displaystyle {\ underline {3}} \ times 5 ^ {2} + {\ underline {1}} \ times 5 ^ {1} + {\ underline {3}} \ times 5 ^ {0} = 75 + 5 + 3 = 83}
6th
334155
6th
{\ displaystyle 334155_ {6}}
3
_
⋅
6th
5
+
3
_
⋅
6th
4th
+
4th
_
⋅
6th
3
+
1
_
⋅
6th
2
+
5
_
⋅
6th
1
+
5
_
⋅
6th
0
=
23328
+
3888
+
864
+
36
+
30th
+
5
=
28151
{\ displaystyle {\ underline {3}} \ cdot 6 ^ {5} + {\ underline {3}} \ cdot 6 ^ {4} + {\ underline {4}} \ cdot 6 ^ {3} + {\ underline {1}} \ times 6 ^ {2} + {\ underline {5}} \ times 6 ^ {1} + {\ underline {5}} \ times 6 ^ {0} = 23328 + 3888 + 864 + 36 + 30 + 5 = 28151}
7th
436
7th
{\ displaystyle 436_ {7}}
4th
_
⋅
7th
2
+
3
_
⋅
7th
1
+
6th
_
⋅
7th
0
= <
196
+
21st
+
6th
=
223
{\ displaystyle {\ underline {4}} \ times 7 ^ {2} + {\ underline {3}} \ times 7 ^ {1} + {\ underline {6}} \ times 7 ^ {0} = <196 + 21 + 6 = 223}
8th
14103
8th
{\ displaystyle 14103_ {8}}
1
_
⋅
8th
4th
+
4th
_
⋅
8th
3
+
1
_
⋅
8th
2
+
0
_
⋅
8th
1
+
3
_
⋅
8th
0
=
4096
+
2048
+
64
+
0
+
3
=
6211
{\ displaystyle {\ underline {1}} \ times 8 ^ {4} + {\ underline {4}} \ times 8 ^ {3} + {\ underline {1}} \ times 8 ^ {2} + {\ underline {0}} \ times 8 ^ {1} + {\ underline {3}} \ times 8 ^ {0} = 4096 + 2048 + 64 + 0 + 3 = 6211}
9
3738
9
{\ displaystyle 3738_ {9}}
3
_
⋅
9
3
+
7th
_
⋅
9
2
+
3
_
⋅
9
1
+
8th
_
⋅
9
0
=
2187
+
567
+
27
+
8th
=
2789
{\ displaystyle {\ underline {3}} \ times 9 ^ {3} + {\ underline {7}} \ times 9 ^ {2} + {\ underline {3}} \ times 9 ^ {1} + {\ underline {8}} \ cdot 9 ^ {0} = 2187 + 567 + 27 + 8 = 2789}
10
294001
10
{\ displaystyle 294001_ {10}}
2
_
⋅
10
5
+
9
_
⋅
10
4th
+
4th
_
⋅
10
3
+
0
_
⋅
10
2
+
0
_
⋅
10
1
+
1
_
⋅
10
0
=
200,000
+
90000
+
4000
+
0
+
0
+
1
=
294001
{\ displaystyle {\ underline {2}} \ cdot 10 ^ {5} + {\ underline {9}} \ cdot 10 ^ {4} + {\ underline {4}} \ cdot 10 ^ {3} + {\ underline {0}} \ times 10 ^ {2} + {\ underline {0}} \ times 10 ^ {1} + {\ underline {1}} \ times 10 ^ {0} = 200000 + 90,000 + 4000 + 0 + 0 + 1 = 294001}
11
2573
11
{\ displaystyle 2573_ {11}}
2
_
⋅
11
3
+
5
_
⋅
11
2
+
7th
_
⋅
11
1
+
3
_
⋅
11
0
=
2662
+
605
+
77
+
3
=
3347
{\ displaystyle {\ underline {2}} \ cdot 11 ^ {3} + {\ underline {5}} \ cdot 11 ^ {2} + {\ underline {7}} \ cdot 11 ^ {1} + {\ underline {3}} \ cdot 11 ^ {0} = 2662 + 605 + 77 + 3 = 3347}
12
6th
B.
8th
A.
B.
77
12
{\ displaystyle 6B8AB77_ {12}}
6th
_
⋅
12
6th
+
11
_
⋅
12
5
+
8th
_
⋅
12
4th
+
10
_
⋅
12
3
+
11
_
⋅
12
2
+
7th
_
⋅
12
1
+
7th
_
⋅
12
0
=
17915904
+
2737152
+
165888
+
17280
+
1584
+
84
+
7th
=
20837899
{\ displaystyle {\ underline {6}} \ cdot 12 ^ {6} + {\ underline {11}} \ cdot 12 ^ {5} + {\ underline {8}} \ cdot 12 ^ {4} + {\ underline {10}} \ times 12 ^ {3} + {\ underline {11}} \ times 12 ^ {2} + {\ underline {7}} \ times 12 ^ {1} + {\ underline {7}} \ cdot 12 ^ {0} = 17915904 + 2737152 + 165888 + 17280 + 1584 + 84 + 7 = 20837899}
13
2216
13
{\ displaystyle 2216_ {13}}
2
_
⋅
13
3
+
2
_
⋅
13
2
+
1
_
⋅
13
1
+
6th
_
⋅
13
0
=
4394
+
338
+
13
+
6th
=
4751
{\ displaystyle {\ underline {2}} \ cdot 13 ^ {3} + {\ underline {2}} \ cdot 13 ^ {2} + {\ underline {1}} \ cdot 13 ^ {1} + {\ underline {6}} \ cdot 13 ^ {0} = 4394 + 338 + 13 + 6 = 4751}
14th
C.
371
C.
D.
14th
{\ displaystyle C371CD_ {14}}
12
_
⋅
14th
5
+
3
_
⋅
14th
4th
+
7th
_
⋅
14th
3
+
1
_
⋅
14th
2
+
12
_
⋅
14th
1
+
13
_
⋅
14th
0
=
6453888
+
115248
+
19208
+
196
+
168
+
13
=
6588721
{\ displaystyle {\ underline {12}} \ cdot 14 ^ {5} + {\ underline {3}} \ cdot 14 ^ {4} + {\ underline {7}} \ cdot 14 ^ {3} + {\ underline {1}} \ times 14 ^ {2} + {\ underline {12}} \ times 14 ^ {1} + {\ underline {13}} \ times 14 ^ {0} = 6453888 + 115248 + 19208 + 196 + 168 + 13 = 6588721}
15th
9880
E.
15th
{\ displaystyle 9880E_ {15}}
9
_
⋅
15th
4th
+
8th
_
⋅
15th
3
+
8th
_
⋅
15th
2
+
0
_
⋅
15th
1
+
14th
_
⋅
15th
0
=
455625
+
27000
+
1800
+
0
+
14th
=
484439
{\ displaystyle {\ underline {9}} \ times 15 ^ {4} + {\ underline {8}} \ times 15 ^ {3} + {\ underline {8}} \ times 15 ^ {2} + {\ underline {0}} \ times 15 ^ {1} + {\ underline {14}} \ times 15 ^ {0} = 455625 + 27000 + 1800 + 0 + 14 = 484439}
16
D.
2
A.
45
16
{\ displaystyle D2A45_ {16}}
13
_
⋅
16
4th
+
2
_
⋅
16
3
+
10
_
⋅
16
2
+
4th
_
⋅
16
1
+
5
_
⋅
16
0
=
851968
+
8192
+
2560
+
64
+
5
=
862789
{\ displaystyle {\ underline {13}} \ times 16 ^ {4} + {\ underline {2}} \ times 16 ^ {3} + {\ underline {10}} \ times 16 ^ {2} + {\ underline {4}} \ times 16 ^ {1} + {\ underline {5}} \ times 16 ^ {0} = 851968 + 8192 + 2560 + 64 + 5 = 862789}
Properties of weak prime numbers in other number systems
In order to determine whether a -digit prime number is a weak prime number as a base , one must control numbers, whether they are compound or not. Only when all numbers are put together is the -digit prime number actually a weak base prime .
k
{\ displaystyle k}
b
{\ displaystyle b}
(
b
-
1
)
⋅
k
{\ displaystyle (b-1) \ cdot k}
(
b
-
1
)
⋅
k
{\ displaystyle (b-1) \ cdot k}
k
{\ displaystyle k}
b
{\ displaystyle b}
Be a base. Then there are infinitely many weak prime numbers on this basis .
b
∈
N
{\ displaystyle b \ in \ mathbb {N}}
b
{\ displaystyle b}
Proof: see by Terence Tao from 2011.
Similar constructs
A similar construct represent the trunkierbaren prime numbers (from the English truncatable prime ) is from these prime numbers, any number of places disconnect without being lost their Primeigenschaft.:
Linkstrunkierbare primes ( Left-truncatable primes ) (sequence A024785 in OEIS ) z. B. 1367 - 367, 67 and 7 would also be prime.
Rechtstrunkierbare primes ( Right-truncatable primes ) (sequence A024770 in OEIS ), for example. B. 3739 - 373, 37 and 3 would also be prime.
Two-sided primes that can be truncated on both sides (sequence A020994 in OEIS ) - in the strict definition of bilateral digit separability, there are only 15 prime numbers with this property:
2, 3, 5, 7, 23, 37, 53, 73, 313, 317, 373, 797, 3137, 3797, 739397
Web links
Individual evidence
^ NJA Sloane : Weakly prime numbers (changing any one decimal digit always produces a composite number). Also called digitally delicate primes. OEIS , accessed December 10, 2018 .
↑ Weakly Primes. primepuzzles.net, 2012, accessed December 10, 2018 (largest known weak prime).
↑ a b Terence Tao : A remark on primality testing and decimal expansions . In: Journal of the Australian Mathematical Society . 91, No. 3, February 22, 2008. arxiv : 0802.3361 . doi : 10.1017 / S1446788712000043 .
↑ Eric W. Weisstein : Truncatable Prime . In: MathWorld (English).
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;">