A Wall-Sun-Sun prime number , named after DD Wall , Zhi-Hong Sun and Zhi-Wei Sun , is a prime p > 5 for which the number divisible
by p
F.
(
p
-
(
p
5
)
)
{\ displaystyle F {\ bigl (} p - {\ bigl (} {\ tfrac {p} {5}} {\ bigr)} {\ bigr)}}
is divisible by . Here, F ( n ) is the n th Fibonacci number and the Legendre symbol of a and b , that is 1 if 5 divides , and otherwise. DD Wall presented in 1960, the question of whether such primes. The question is still open today, in particular no Wall-Sun-Sun prime numbers are known. If a Wall-Sun-Sun prime exists, it must be greater than 9.7 × 10 14 . There is a presumption that there are infinitely many.
p
2
{\ displaystyle p ^ {2}}
(
a
b
)
{\ displaystyle {\ bigl (} {\ tfrac {a} {b}} {\ bigr)}}
(
p
5
)
{\ displaystyle {\ bigl (} {\ tfrac {p} {5}} {\ bigr)}}
p
2
-
1
{\ displaystyle p ^ {2} -1}
-
1
{\ displaystyle -1}
Zhi-Hong Sun and Zhi-Wei Sun showed in 1992 that an odd prime p is a Wall-Sun-Sun prime if there is a certain counter-example to Fermat's conjecture , namely integers x , y , z with x that are not divisible by p p + y p = z p . Wieferich had also proven this property in 1909 for Wieferich prime numbers . With the proof of the conjecture in 1995, however, it is clear that no counterexample exists, i.e. that the requirement cannot be met.
See also
Web links
Individual evidence
↑ DD Wall : Fibonacci series modulo m . In: American Mathematical Monthly , 67, 1960, pp. 525-532 (English)
↑ François G. Dorais, Dominic W. Klyve: A Wieferich prime search up to 6.7 x 10 15 . In: Journal of Integer Sequences , October 14, 16, 2011, Article 11.9.2
↑ Jiří Klaška: Short remark on Fibonacci Wieferich primes . In: Acta Mathematica Universitatis Ostraviensis , 15, 2007, pp. 21-25 (English)
↑ Zhi-Hong Sun , Zhi-Wei Sun : Fibonacci numbers and Fermat's last theorem . (PDF; 186 kB) In: Acta Arithmetica , 60, 1992, pp. 371-388
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;">