Woodall number

Last updated March 07, 2023

In number theory, a Woodall number (W_n) is any natural number of the form

History

Woodall numbers were first studied by Allan J. C. Cunningham and H. J. Woodall in 1917,^[1] inspired by James Cullen's earlier study of the similarly defined Cullen numbers.

Woodall primes

Unsolved problem in mathematics:

Are there infinitely many Woodall primes?

(more unsolved problems in mathematics)

Woodall numbers that are also prime numbers are called Woodall primes; the first few exponents n for which the corresponding Woodall numbers W_n are prime are 2, 3, 6, 30, 75, 81, 115, 123, 249, 362, 384, ... (sequence A002234 in the OEIS ); the Woodall primes themselves begin with 7, 23, 383, 32212254719, ... (sequence A050918 in the OEIS ).

In 1976 Christopher Hooley showed that almost all Cullen numbers are composite.^[2] In October 1995, Wilfred Keller published a paper discussing several new Cullen primes and the efforts made to factorise other Cullen and Woodall numbers. Included in that paper is a personal communication to Keller from Hiromi Suyama, asserting that Hooley's method can be reformulated to show that it works for any sequence of numbers $n \cdot 2 n + a + b$ , where a and b are integers, and in particular, that almost all Woodall numbers are composite.^[3] It is an open problem whether there are infinitely many Woodall primes. As of October 2018^[update], the largest known Woodall prime is 17016602 × 2^17016602 − 1.^[4] It has 5,122,515 digits and was found by Diego Bertolotti in March 2018 in the distributed computing project PrimeGrid.^[5]

Restrictions

Starting with W₄ = 63 and W₅ = 159, every sixth Woodall number is divisible by 3; thus, in order for W_n to be prime, the index n cannot be congruent to 4 or 5 (modulo 6). Also, for a positive integer m, the Woodall number W_2^m may be prime only if 2^m + m is prime. As of January 2019, the only known primes that are both Woodall primes and Mersenne primes are W₂ = M₃ = 7, and W₅₁₂ = M₅₂₁.

Divisibility properties

Like Cullen numbers, Woodall numbers have many divisibility properties. For example, if p is a prime number, then p divides

W_{(p + 1) / 2} if the Jacobi symbol

\left({\frac {2}{p}}\right)

is +1 and

W_{(3p − 1) / 2} if the Jacobi symbol

\left({\frac {2}{p}}\right)

is −1.^{[ citation needed ]}

Generalization

A generalized Woodall number base b is defined to be a number of the form n × bⁿ − 1, where n + 2 > b; if a prime can be written in this form, it is then called a generalized Woodall prime.

The smallest value of n such that n × bⁿ − 1 is prime for b = 1, 2, 3, ... are^[6]

3, 2, 1, 1, 8, 1, 2, 1, 10, 2, 2, 1, 2, 1, 2, 167, 2, 1, 12, 1, 2, 2, 29028, 1, 2, 3, 10, 2, 26850, 1, 8, 1, 42, 2, 6, 2, 24, 1, 2, 3, 2, 1, 2, 1, 2, 2, 140, 1, 2, 2, 22, 2, 8, 1, 2064, 2, 468, 6, 2, 1, 362, 1, 2, 2, 6, 3, 26, 1, 2, 3, 20, 1, 2, 1, 28, 2, 38, 5, 3024, 1, 2, 81, 858, 1, 2, 3, 2, 8, 60, 1, 2, 2, 10, 5, 2, 7, 182, 1, 17782, 3, ... (sequence A240235 in the OEIS )

As of November 2021^[update], the largest known generalized Woodall prime with base greater than 2 is 2740879 × 32^2740879 − 1.^[7]

b	Numbers n such that n × bⁿ − 1 is prime^[6]	OEIS sequence
3	1, 2, 6, 10, 18, 40, 46, 86, 118, 170, 1172, 1698, 1810, 2268, 4338, 18362, 72662, 88392, 94110, 161538, 168660, 292340, 401208, 560750, 1035092, ...	A006553
4	1, 2, 3, 5, 8, 14, 23, 63, 107, 132, 428, 530, 1137, 1973, 2000, 7064, 20747, 79574, 113570, 293912, ..., 1993191, ...	A086661
5	8, 14, 42, 384, 564, 4256, 6368, 21132, 27180, 96584, 349656, 545082, ...	A059676
6	1, 2, 3, 19, 20, 24, 34, 77, 107, 114, 122, 165, 530, 1999, 4359, 11842, 12059, 13802, 22855, 41679, 58185, 145359, 249987, ...	A059675
7	2, 18, 68, 84, 3812, 14838, 51582, ...	A242200
8	1, 2, 7, 12, 25, 44, 219, 252, 507, 1155, 2259, 2972, 4584, 12422, 13905, 75606, ...	A242201
9	10, 58, 264, 1568, 4198, 24500, ...	A242202
10	2, 3, 8, 11, 15, 39, 60, 72, 77, 117, 183, 252, 396, 1745, 2843, 4665, 5364, ...	A059671
11	2, 8, 252, 1184, 1308, ...	A299374
12	1, 6, 43, 175, 821, 910, 1157, 13748, 27032, 71761, 229918, ...	A299375
13	2, 6, 563528, ...	A299376
14	1, 3, 7, 98, 104, 128, 180, 834, 1633, 8000, 28538, 46605, 131941, 147684, 433734, ...	A299377
15	2, 10, 14, 2312, 16718, 26906, 27512, 41260, 45432, 162454, 217606, ...	A299378
16	167, 189, 639, ...	A299379
17	2, 18, 20, 38, 68, 3122, 3488, 39500, ...	A299380
18	1, 2, 6, 8, 10, 28, 30, 39, 45, 112, 348, 380, 458, 585, 17559, 38751, 43346, 46984, 92711, ...	A299381
19	12, 410, 33890, 91850, 146478, 189620, 280524, ...	A299382
20	1, 18, 44, 60, 80, 123, 429, 1166, 2065, 8774, 35340, 42968, 50312, 210129, ...	A299383

Related Research Articles

Amicable numbers are two different natural numbers related in such a way that the sum of the proper divisors of each is equal to the other number. That is, s(a)=b and s(b)=a, where s(n)=σ(n)-n is equal to the sum of positive divisors of n except n itself (see also divisor function).

In mathematics, a Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form $M n = 2 n - 1$ for some integer $n$ . They are named after Marin Mersenne, a French Minim friar, who studied them in the early 17th century. If $n$ is a composite number then so is $2 n - 1$ . Therefore, an equivalent definition of the Mersenne primes is that they are the prime numbers of the form $M p = 2 p - 1$ for some prime $p$ .

<span class="mw-page-title-main">Prime number</span> Evenly divided only by 1 or itself

A prime number 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 of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order.

In number theory, the Fermat pseudoprimes make up the most important class of pseudoprimes that come from Fermat's little theorem.

In mathematics, a Fermat number, named after Pierre de Fermat, who first studied them, is a positive integer of the form

In number theory, a Sierpiński number is an odd natural number k such that $is composite for all natural numbers n . In 1960, Wacław Sierpiński proved that there are infinitely many odd integers k which have this property.$

In recreational mathematics, a repunit is a number like 11, 111, or 1111 that contains only the digit 1 — a more specific type of repdigit. The term stands for repeated unit and was coined in 1966 by Albert H. Beiler in his book Recreations in the Theory of Numbers.

In recreational mathematics, a repdigit or sometimes monodigit is a natural number composed of repeated instances of the same digit in a positional number system. The word is a portmanteau of repeated and digit. Examples are 11, 666, 4444, and 999999. All repdigits are palindromic numbers and are multiples of repunits. Other well-known repdigits include the repunit primes and in particular the Mersenne primes.

In mathematics, a Cullen number is a member of the integer sequence $. Cullen numbers were first studied by James Cullen in 1905. The numbers are special cases of Proth numbers.$

In mathematics, a k-hyperperfect number is a natural number n for which the equality n = 1 + k(σ(n) − n − 1) holds, where σ(n) is the divisor function (i.e., the sum of all positive divisors of n). A hyperperfect number is a k-hyperperfect number for some integer k. Hyperperfect numbers generalize perfect numbers, which are 1-hyperperfect.

In number theory, a Wieferich prime is a prime number p such that p² divides $2 p - 1 - 1$ , therefore connecting these primes with Fermat's little theorem, which states that every odd prime p divides $2 p - 1 - 1$ . Wieferich primes were first described by Arthur Wieferich in 1909 in works pertaining to Fermat's Last Theorem, at which time both of Fermat's theorems were already well known to mathematicians.

In number theory, a Wilson prime is a prime number $such that divides, where "!} " denotes the factorial function; compare this with Wilson's theorem, which states that every prime divides . Both are named for 18th-century English mathematician John Wilson; in 1770, Edward Waring credited the theorem to Wilson, although it had been stated centuries earlier by Ibn al-Haytham.$

23 (twenty-three) is the natural number following 22 and preceding 24.

A cuban prime is a prime number that is also a solution to one of two different specific equations involving differences between third powers of two integers x and y.

In mathematics, a double Mersenne number is a Mersenne number of the form

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

An untouchable number is a positive integer that cannot be expressed as the sum of all the proper divisors of any positive integer. That is, these numbers are not in the image of the aliquot sum function. Their study goes back at least to Abu Mansur al-Baghdadi, who observed that both 2 and 5 are untouchable.

In number theory, a Pierpont prime is a prime number of the form

In number theory, a pernicious number is a positive integer such that the Hamming weight of its binary representation is prime, that is, there is a prime number of 1's when it is written as a binary number.

References

↑ Cunningham, A. J. C; Woodall, H. J. (1917), "Factorisation of $Q=(2^{q}\mp q)$ and $(q\cdot {2^{q}}\mp 1)$ ", Messenger of Mathematics , 47: 1–38.
↑ Everest, Graham; van der Poorten, Alf; Shparlinski, Igor; Ward, Thomas (2003). Recurrence sequences. Mathematical Surveys and Monographs. Vol. 104. Providence, RI: American Mathematical Society. p. 94. ISBN 0-8218-3387-1. Zbl 1033.11006.
↑ Keller, Wilfrid (January 1995). "New Cullen primes". Mathematics of Computation . 64 (212): 1739. doi: 10.1090/S0025-5718-1995-1308456-3 . ISSN 0025-5718.Keller, Wilfrid (December 2013). "Wilfrid Keller". www.fermatsearch.org. Hamburg. Archived from the original on February 28, 2020. Retrieved October 1, 2020.
↑ "The Prime Database: 8508301*2^17016603-1", Chris Caldwell's The Largest Known Primes Database, retrieved March 24, 2018
↑ PrimeGrid, Announcement of 17016602*2^17016602 - 1 (PDF), retrieved April 1, 2018
1 2 List of generalized Woodall primes base 3 to 10000
↑ "The Top Twenty: Generalized Woodall". primes.utm.edu. Retrieved 20 November 2021.

External links

Chris Caldwell, The Prime Glossary: Woodall number, and The Top Twenty: Woodall, and The Top Twenty: Generalized Woodall, at The Prime Pages.
Weisstein, Eric W. "Woodall number". MathWorld .
Steven Harvey, List of Generalized Woodall primes.
Paul Leyland, Generalized Cullen and Woodall Numbers

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] Cunningham, A. J. C; Woodall, H. J. (1917), "Factorisation of $Q=(2^{q}\mp q)$ and $(q\cdot {2^{q}}\mp 1)$ ", Messenger of Mathematics , 47: 1–38.

[EPSW94-2] Everest, Graham; van der Poorten, Alf; Shparlinski, Igor; Ward, Thomas (2003). Recurrence sequences. Mathematical Surveys and Monographs. Vol. 104. Providence, RI: American Mathematical Society. p. 94. ISBN 0-8218-3387-1. Zbl 1033.11006.

[3] Keller, Wilfrid (January 1995). "New Cullen primes". Mathematics of Computation . 64 (212): 1739. doi: 10.1090/S0025-5718-1995-1308456-3 . ISSN 0025-5718.Keller, Wilfrid (December 2013). "Wilfrid Keller". www.fermatsearch.org. Hamburg. Archived from the original on February 28, 2020. Retrieved October 1, 2020.

[4] "The Prime Database: 8508301*2^17016603-1", Chris Caldwell's The Largest Known Primes Database, retrieved March 24, 2018

[5] PrimeGrid, Announcement of 17016602*2^17016602 - 1 (PDF), retrieved April 1, 2018

[tripod-6] 1 2 List of generalized Woodall primes base 3 to 10000

[7] "The Top Twenty: Generalized Woodall". primes.utm.edu. Retrieved 20 November 2021.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

v t e Prime number classes
By formula	Fermat ( $2 2 n + 1$ ) Mersenne ( $2 p - 1$ ) Double Mersenne ( $2 2 p -1 - 1$ ) Wagstaff $(2 p + 1)/3$ Proth ( $k \cdot2 n + 1$ ) Factorial ( $n! \pm 1$ ) Primorial ( $p n # \pm 1$ ) Euclid ( $p n # + 1$ ) Pythagorean ( $4 n + 1$ ) Pierpont ( $2 m \cdot3 n + 1$ ) Quartan ( $x 4 + y 4$ ) Solinas ( $2 m \pm 2 n \pm 1$ ) Cullen ( $n \cdot2 n + 1$ ) Woodall ( $n \cdot2 n - 1$ ) Cuban ( $x 3 - y 3)/(x - y$ ) Leyland ( $x y + y x$ ) Thabit ( $3\cdot2 n - 1$ ) Williams ( $(b -1)\cdot b n - 1$ ) Mills ( $⌊ A 3 n ⌋$ )
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 Unique
Base-dependent	Palindromic Emirp Repunit $(10 n - 1)/9$ Permutable Circular Truncatable Minimal Delicate Primeval Full reptend Unique Happy Self Smarandache–Wellin Strobogrammatic Dihedral Tetradic
Patterns	Twin ( $p, p + 2$ ) Bi-twin chain ( $n \pm 1, 2 n \pm 1, 4 n \pm 1, \dots$ ) 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/Safe ( $p, 2 p + 1$ ) Cunningham ( $p, 2 p \pm 1, 4 p \pm 3, 8 p \pm 7, ...$ ) Arithmetic progression ( $p + a\cdotn, n = 0, 1, 2, 3, ...$ ) Balanced ( $consecutive p - n, p, p + n$ )
By size	Mega (1,000,000+ digits) Largest known list
Complex numbers	Eisenstein prime Gaussian prime
Composite numbers	Pseudoprime Catalan Elliptic Euler Euler–Jacobi Fermat Frobenius Lucas Somer–Lucas Strong Carmichael number Almost prime Semiprime Interprime Pernicious
Related topics	Probable prime Industrial-grade prime Illegal prime Formula for primes Prime gap
First 60 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 233 239 241 251 257 263 269 271 277 281
List of prime numbers