Wagstaff prime

Wagstaff prime
Named after	Samuel S. Wagstaff, Jr.
Publication year	1989^[1]
Author of publication	Bateman, P. T., Selfridge, J. L., Wagstaff Jr., S. S.
No. of known terms	43
First terms	3, 11, 43, 683
Largest known term	(2^13372531+1)/3
OEIS index	A000979

In number theory, a Wagstaff prime is a prime number p of the form

p={{2^{q}+1} \over 3}

where q is an odd prime. Wagstaff primes are named after the mathematician Samuel S. Wagstaff Jr.; the prime pages credit François Morain for naming them in a lecture at the Eurocrypt 1990 conference. Wagstaff primes are related to the New Mersenne conjecture and have applications in cryptography.

Examples

The first three Wagstaff primes are 3, 11, and 43 because

{\begin{aligned}3&={2^{3}+1 \over 3},\\[5pt]11&={2^{5}+1 \over 3},\\[5pt]43&={2^{7}+1 \over 3}.\end{aligned}}

Known Wagstaff primes

The first few Wagstaff primes are:

3, 11, 43, 683, 2731, 43691, 174763, 2796203, 715827883, 2932031007403, 768614336404564651, … (sequence A000979 in the OEIS)

As of October 2014, known exponents which produce Wagstaff primes or probable primes are:

3, 5, 7, 11, 13, 17, 19, 23, 31, 43, 61, 79, 101, 127, 167, 191, 199, 313, 347, 701, 1709, 2617, 3539, 5807, 10501, 10691, 11279, 12391, 14479, 42737, 83339, 95369, 117239, 127031, 138937, 141079, 267017, 269987, 374321, 986191, 4031399, …, 13347311, 13372531 (sequence A000978 in the OEIS)

In February 2010, Tony Reix discovered the Wagstaff probable prime:

{\frac {2^{{4031399}}+1}3}

which has 1,213,572 digits and was the 3rd biggest probable prime ever found at this date.^[2]

In September 2013, Ryan Propper announced the discovery of two additional Wagstaff probable primes:^[3]

{\frac {2^{{13347311}}+1}3}

and

{\frac {2^{{13372531}}+1}3}

Each is a probable prime with slightly more than 4 million decimal digits. It is not currently known whether there are any exponents between 4031399 and 13347311 that produce Wagstaff probable primes.

Primality testing

These numbers are proven to be prime for the values of q up to 83339. Those with q > 83339 are probable primes as of April 2015. The primality proof for q = 42737 was performed by François Morain in 2007 with a distributed ECPP implementation running on several networks of workstations for 743 GHz-days on an Opteron processor.^[4] It was the third largest primality proof by ECPP from its discovery until March 2009.^[5]

Currently, the fastest known algorithm for proving the primality of Wagstaff numbers is ECPP.

The LLR (Lucas-Lehmer-Riesel) tool by Jean Penné is used to find Wagstaff probable primes by means of the Vrba-Reix test. It is a PRP test based on the properties of a cycle of the digraph under x^2-2 modulo a Wagstaff number.

Generalizations

It is natural to consider^[6] more generally numbers of the form

Q(b,n)={\frac {b^{n}+1}{b+1}}

where the base $b\geq 2$ . Since for $n$ odd we have

{\frac {b^{n}+1}{b+1}}={\frac {(-b)^{n}-1}{(-b)-1}}=R_{n}(-b)

these numbers are called "Wagstaff numbers base $b$ ", and sometimes considered^[7] a case of the repunit numbers with negative base $-b$ .

For some specific values of $b$ , all $Q(b,n)$ (with a possible exception for very small $n$ ) are composite because of an "algebraic" factorization. Specifically, if $b$ has the form of a perfect power with odd exponent (like 8, 27, 32, 64, 125, 128, 216, 243, 343, 512, 729, 1000, etc. (sequence A070265 in the OEIS)), then the fact that $x^{m}+1$ , with $m$ odd, is divisible by $x+1$ shows that $Q(a^{m},n)$ is divisible by $a^{n}+1$ in these special cases. Another case is $b=4k^{4}$ , with k positive integer (like 4, 64, 324, 1024, 2500, 5184, etc. (sequence A141046 in the OEIS)), where we have the aurifeuillean factorization.

However, when $b$ does not admit an algebraic factorization, it is conjectured that an infinite number of $n$ values make $Q(b,n)$ prime, notice all ns are odd primes.

For $b=10$ , the primes themselves have the following appearance: 9091, 909091, 909090909090909091, 909090909090909090909090909091, … (sequence A097209 in the OEIS), and these ns are: 5, 7, 19, 31, 53, 67, 293, 641, 2137, 3011, 268207, ... (sequence A001562 in the OEIS).

Least prime p such that $Q(n,p)$ is prime are (starts with n = 2, 0 if no such p exists)

3, 3, 3, 5, 3, 3, 0, 3, 5, 5, 5, 3, 7, 3, 3, 7, 3, 17, 5, 3, 3, 11, 7, 3, 11, 0, 3, 7, 139, 109, 0, 5, 3, 11, 31, 5, 5, 3, 53, 17, 3, 5, 7, 103, 7, 5, 5, 7, 1153, 3, 7, 21943, 7, 3, 37, 53, 3, 17, 3, 7, 11, 3, 0, 19, 7, 3, 757, 11, 3, 5, 3, ... (sequence A084742 in the OEIS)

Least base b such that $Q(b,prime(n))$ is prime are (starts with n = 2)

2, 2, 2, 2, 2, 2, 2, 2, 7, 2, 16, 61, 2, 6, 10, 6, 2, 5, 46, 18, 2, 49, 16, 70, 2, 5, 6, 12, 92, 2, 48, 89, 30, 16, 147, 19, 19, 2, 16, 11, 289, 2, 12, 52, 2, 66, 9, 22, 5, 489, 69, 137, 16, 36, 96, 76, 117, 26, 3, ... (sequence A103795 in the OEIS)

References

↑ Bateman, P. T.; Selfridge, J. L.; Wagstaff, Jr., S. S. (1989). "The New Mersenne Conjecture". American Mathematical Monthly. 96: 125–128. JSTOR 2323195. doi:10.2307/2323195.
↑ PRP Records
↑ New Wagstaff PRP exponents, mersenneforum.org
↑ Comment by François Morain, The Prime Database: (2⁴²⁷³⁷ + 1)/3 at The Prime Pages.
↑ Caldwell, Chris, "The Top Twenty: Elliptic Curve Primality Proof", The Prime Pages
↑ Dubner, H. and Granlund, T.: Primes of the Form (bⁿ + 1)/(b + 1), Journal of Integer Sequences, Vol. 3 (2000)
↑ Repunit, Wolfram MathWorld (Eric W. Weisstein)

External links

John Renze and Eric W. Weisstein. "Wagstaff prime". MathWorld.

Chris Caldwell, The Top Twenty: Wagstaff at The Prime Pages.
Renaud Lifchitz, "An efficient probable prime test for numbers of the form (2^p + 1)/3".
Tony Reix, "Three conjectures about primality testing for Mersenne, Wagstaff and Fermat numbers based on cycles of the Digraph under x² − 2 modulo a prime".
List of repunits in base -50 to 50

Prime number classes
By formula	Fermat (2^2ⁿ + 1) Mersenne (2^p − 1) Double Mersenne (2^{2^p−1} − 1) Wagstaff (2^p + 1)/3 Proth (k·2ⁿ + 1) Factorial (n! ± 1) Primorial (p_n# ± 1) Euclid (p_n# + 1) Pythagorean (4n + 1) Pierpont (2^u·3^v + 1) Quartan (x⁴ + y⁴) Solinas (2^a ± 2^b ± 1) Cullen (n·2ⁿ + 1) Woodall (n·2ⁿ − 1) Cuban (x³ − y³)/(x − y) Carol (2ⁿ − 1)² − 2 Kynea (2ⁿ + 1)² − 2 Leyland (x^y + y^x) Thabit (3·2ⁿ − 1) Mills (floor(A^3ⁿ))
By integer sequence	Fibonacci Lucas Pell Newman–Shanks–Williams Perrin Partitions Bell Motzkin
By property	Wieferich (pair) Wall–Sun–Sun Wolstenholme Wilson Lucky Fortunate Ramanujan Pillai Regular Strong Stern Supersingular (elliptic curve) Supersingular (moonshine theory) Good Super Higgs Highly cototient
Base-dependent	Happy Dihedral Palindromic Emirp Repunit (10ⁿ − 1)/9 Permutable Circular Truncatable Strobogrammatic Minimal Weakly Full reptend Unique Primeval Self Smarandache–Wellin
Patterns	Twin (p, p + 2) Bi-twin chain (n − 1, n + 1, 2n − 1, 2n + 1, …) Triplet (p, p + 2 or p + 4, p + 6) Quadruplet (p, p + 2, p + 6, p + 8) k−Tuple Cousin (p, p + 4) Sexy (p, p + 6) Chen Sophie Germain (p, 2p + 1) Cunningham chain (p, 2p ± 1, …) Safe (p, (p − 1)/2) Arithmetic progression (p + a·n, n = 0, 1, …) Balanced (consecutive p − n, p, p + n)
By size	Titanic (1,000+ digits) Gigantic (10,000+) Mega (1,000,000+) Largest known
Complex numbers	Eisenstein prime Gaussian prime
Composite numbers	Pseudoprime Almost prime Semiprime Interprime
Related topics	Probable prime Industrial-grade prime Illegal prime Formula for primes Prime gap
First 50 primes	2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229
List of prime numbers

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.