Wall–Sun–Sun prime
   HOME

TheInfoList



OR:

In
number theory Number theory (or arithmetic or higher arithmetic in older usage) is a branch of pure mathematics devoted primarily to the study of the integers and integer-valued functions. German mathematician Carl Friedrich Gauss (1777–1855) said, "Mat ...
, a Wall–Sun–Sun prime or Fibonacci–Wieferich prime is a certain kind of
prime number A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways ...
which is conjectured to exist, although none are known.


Definition

Let p be a prime number. When each term in the sequence of
Fibonacci numbers In mathematics, the Fibonacci numbers, commonly denoted , form a sequence, the Fibonacci sequence, in which each number is the sum of the two preceding ones. The sequence commonly starts from 0 and 1, although some authors start the sequence from ...
F_n is reduced modulo p, the result is a
periodic sequence In mathematics, a periodic sequence (sometimes called a cycle) is a sequence for which the same terms are repeated over and over: :''a''1, ''a''2, ..., ''a'p'',  ''a''1, ''a''2, ..., ''a'p'',  ''a''1, ''a''2, ..., ''a' ...
. The (minimal) period length of this sequence is called the
Pisano period In number theory, the ''n''th Pisano period, written as '(''n''), is the period with which the sequence of Fibonacci numbers taken modulo ''n'' repeats. Pisano periods are named after Leonardo Pisano, better known as Fibonacci. The existence of ...
and denoted \pi(p). Since F_0 = 0, it follows that ''p''
divides In mathematics, a divisor of an integer n, also called a factor of n, is an integer m that may be multiplied by some integer to produce n. In this case, one also says that n is a multiple of m. An integer n is divisible or evenly divisible by ...
F_. A prime ''p'' such that ''p''2 divides F_ is called a Wall–Sun–Sun prime.


Equivalent definitions

If \alpha(m) denotes the rank of apparition modulo m (i.e., \alpha(m) is the smallest positive index m such that m divides F_), then a Wall–Sun–Sun prime can be equivalently defined as a prime p such that p^2 divides F_. For a prime ''p'' ≠ 2, 5, the rank of apparition \alpha(p) is known to divide p - \left(\tfrac\right), where the Legendre symbol \textstyle\left(\frac\right) has the values :\left(\frac\right) = \begin 1 &\textp \equiv \pm1 \pmod 5;\\ -1 &\textp \equiv \pm2 \pmod 5.\end This observation gives rise to an equivalent characterization of Wall–Sun–Sun primes as primes p such that p^2 divides the Fibonacci number F_. A prime p is a Wall–Sun–Sun prime if and only if \pi(p^2) = \pi(p). A prime p is a Wall–Sun–Sun prime if and only if L_p \equiv 1 \pmod, where L_p is the p-th
Lucas number The Lucas numbers or Lucas series are an integer sequence named after the mathematician François Édouard Anatole Lucas (1842–1891), who studied both that sequence and the closely related Fibonacci numbers. Lucas numbers and Fibonacci n ...
. McIntosh and Roettger establish several equivalent characterizations of Lucas–Wieferich primes. In particular, let \epsilon = \left(\tfrac\right); then the following are equivalent: * F_ \equiv 0 \pmod * L_ \equiv 2\epsilon \pmod * L_ \equiv 2\epsilon \pmod * F_p \equiv \epsilon \pmod * L_p \equiv 1 \pmod


Existence

In a study of the Pisano period k(p), Donald Dines Wall determined that there are no Wall–Sun–Sun primes less than 10000. In 1960, he wrote: It has since been conjectured that there are infinitely many Wall–Sun–Sun primes. No Wall–Sun–Sun primes are known . In 2007, Richard J. McIntosh and Eric L. Roettger showed that if any exist, they must be > 2. Dorais and Klyve extended this range to 9.7 without finding such a prime. In December 2011, another search was started by the
PrimeGrid PrimeGrid is a volunteer computing project that searches for very large (up to world-record size) prime numbers whilst also aiming to solve long-standing mathematical conjectures. It uses the Berkeley Open Infrastructure for Network Computing ...
project, however it was suspended in May 2017. In November 2020, PrimeGrid started another project that searches for Wieferich and Wall–Sun–Sun primes simultaneously. The project ended in December 2022, definitely proving that any Wall–Sun–Sun prime must exceed 2^ (about 18\cdot 10^).


History

Wall–Sun–Sun primes are named after Donald Dines Wall, Zhi Hong Sun and
Zhi Wei Sun Sun Zhiwei (, born October 16, 1965) is a Chinese mathematician, working primarily in number theory, combinatorics, and group theory. He is a professor at Nanjing University. Biography Sun Zhiwei was born in Huai'an, Jiangsu. Sun and his tw ...
; Z. H. Sun and Z. W. Sun showed in 1992 that if the first case of
Fermat's Last Theorem In number theory, Fermat's Last Theorem (sometimes called Fermat's conjecture, especially in older texts) states that no three positive integers , , and satisfy the equation for any integer value of greater than 2. The cases and have been ...
was false for a certain prime ''p'', then ''p'' would have to be a Wall–Sun–Sun prime. As a result, prior to
Andrew Wiles Sir Andrew John Wiles (born 11 April 1953) is an English mathematician and a Royal Society Research Professor at the University of Oxford, specializing in number theory. He is best known for proving Fermat's Last Theorem, for which he was awa ...
' proof of Fermat's Last Theorem, the search for Wall–Sun–Sun primes was also the search for a potential
counterexample A counterexample is any exception to a generalization. In logic a counterexample disproves the generalization, and does so rigorously in the fields of mathematics and philosophy. For example, the fact that "John Smith is not a lazy student" is a ...
to this centuries-old conjecture.


Generalizations

A tribonacci–Wieferich prime is a prime ''p'' satisfying , where ''h'' is the least positive integer satisfying 'T''''h'',''T''''h''+1,''T''''h''+2'T''0, ''T''1, ''T''2(mod ''m'') and ''T''''n'' denotes the ''n''-th
tribonacci number In mathematics, the Fibonacci numbers form a sequence defined recursively by: :F_n = \begin 0 & n = 0 \\ 1 & n = 1 \\ F_ + F_ & n > 1 \end That is, after two starting values, each number is the sum of the two preceding numbers. The Fibonacci seque ...
. No tribonacci–Wieferich prime exists below 1011. A Pell–Wieferich prime is a prime ''p'' satisfying ''p''2 divides ''P''''p''−1, when ''p'' congruent to 1 or 7 (mod 8), or ''p''2 divides ''P''''p''+1, when ''p'' congruent to 3 or 5 (mod 8), where ''P''''n'' denotes the ''n''-th
Pell number In mathematics, the Pell numbers are an infinite sequence of integers, known since ancient times, that comprise the denominators of the closest rational approximations to the square root of 2. This sequence of approximations begins , , , , an ...
. For example, 13, 31, and 1546463 are Pell–Wieferich primes, and no others below 109 . In fact, Pell–Wieferich primes are 2-Wall–Sun–Sun primes.


Near-Wall–Sun–Sun primes

A prime ''p'' such that F_ \equiv Ap \pmod with small , ''A'', is called near-Wall–Sun–Sun prime. Near-Wall–Sun–Sun primes with ''A'' = 0 would be Wall–Sun–Sun primes. PrimeGrid recorded cases with , ''A'', ≤ 1000. A dozen cases are known where ''A'' = ±1 .


Wall–Sun–Sun primes with discriminant ''D''

Wall–Sun–Sun primes can be considered for the
field Field may refer to: Expanses of open ground * Field (agriculture), an area of land used for agricultural purposes * Airfield, an aerodrome that lacks the infrastructure of an airport * Battlefield * Lawn, an area of mowed grass * Meadow, a grass ...
Q_ with discriminant ''D''. For the conventional Wall–Sun–Sun primes, ''D'' = 5. In the general case, a Lucas–Wieferich prime ''p'' associated with (''P'', ''Q'') is a Wieferich prime to base ''Q'' and a Wall–Sun–Sun prime with discriminant ''D'' = ''P''2 – 4''Q''. In this definition, the prime ''p'' should be odd and not divide ''D''. It is conjectured that for every natural number ''D'', there are infinitely many Wall–Sun–Sun primes with discriminant ''D''. The case of (P,Q) = (k,-1) corresponds to the ''k''-Wall–Sun–Sun primes, for which Wall–Sun–Sun primes represent the special case ''k'' = 1. The ''k''-Wall–Sun–Sun primes can be explicitly defined as primes ''p'' such that ''p''2 divides the ''k''-Fibonacci number F_k(\pi_k(p)), where ''Fk''(''n'') = ''Un''(''k'', −1) is a
Lucas sequence In mathematics, the Lucas sequences U_n(P,Q) and V_n(P, Q) are certain constant-recursive integer sequences that satisfy the recurrence relation : x_n = P \cdot x_ - Q \cdot x_ where P and Q are fixed integers. Any sequence satisfying this rec ...
of the first kind with discriminant ''D'' = ''k''2 + 4 and \pi_k(p) is the Pisano period of ''k''-Fibonacci numbers modulo ''p''. For a prime ''p'' ≠ 2 and not dividing ''D'', this condition is equivalent to either of the following. * ''p''2 divides F_k\left(p - \left(\tfrac\right)\right), where \left(\tfrac\right) is the
Kronecker symbol In number theory, the Kronecker symbol, written as \left(\frac an\right) or (a, n), is a generalization of the Jacobi symbol to all integers n. It was introduced by . Definition Let n be a non-zero integer, with prime factorization :n=u \cdot ...
; * ''Vp''(''k'', −1) ≡ ''k'' (mod ''p''2), where ''Vn''(''k'', −1) is a Lucas sequence of the second kind. The smallest ''k''-Wall–Sun–Sun primes for ''k'' = 2, 3, ... are :13, 241, 2, 3, 191, 5, 2, 3, 2683, ...


See also

*
Wieferich prime In number theory, a Wieferich prime is a prime number ''p'' such that ''p''2 divides , therefore connecting these primes with Fermat's little theorem, which states that every odd prime ''p'' divides . Wieferich primes were first described by Ar ...
* Wolstenholme prime * Wilson prime *
PrimeGrid PrimeGrid is a volunteer computing project that searches for very large (up to world-record size) prime numbers whilst also aiming to solve long-standing mathematical conjectures. It uses the Berkeley Open Infrastructure for Network Computing ...
* Fibonacci prime *
Pisano period In number theory, the ''n''th Pisano period, written as '(''n''), is the period with which the sequence of Fibonacci numbers taken modulo ''n'' repeats. Pisano periods are named after Leonardo Pisano, better known as Fibonacci. The existence of ...
* Table of congruences


References


Further reading

* *


External links

* Chris Caldwell
The Prime Glossary: Wall–Sun–Sun prime
at the
Prime Pages The PrimePages is a website about prime numbers maintained by Chris Caldwell at the University of Tennessee at Martin. The site maintains the list of the "5,000 largest known primes", selected smaller primes of special forms, and many "top twenty" ...
. * * Richard McIntosh
Status of the search for Wall–Sun–Sun primes (October 2003)
* {{DEFAULTSORT:Wall-Sun-Sun prime Classes of prime numbers Unsolved problems in number theory