World Library  
Flag as Inappropriate
Email this Article

Wilson prime

Article Id: WHEBN0000323646
Reproduction Date:

Title: Wilson prime  
Author: World Heritage Encyclopedia
Language: English
Subject: Wieferich prime, Wolstenholme prime, List of prime numbers, Wilson's theorem, Megaprime
Collection:
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Wilson prime

Wilson prime
Named after John Wilson
Publication year 1938[1]
Author of publication Emma Lehmer
Number of known terms 3
First terms 5, 13, 563
Largest known term 563
OEIS index A007540

A Wilson prime, named after English mathematician John Wilson, is a prime number p such that p2 divides (p − 1)! + 1, where "!" denotes the factorial function; compare this with Wilson's theorem, which states that every prime p divides (p − 1)! + 1.

The only known Wilson primes are 5, 13, and 563 (sequence A007540 in OEIS); if any others exist, they must be greater than 2×1013.[2] It has been conjectured that infinitely many Wilson primes exist, and that the number of Wilson primes in an interval [xy] is about log(log(y)/log(x)).[3]

Several computer searches have been done in the hope of finding new Wilson primes.[4][5][6] The Ibercivis distributed computing project includes a search for Wilson primes.[7] Another search is coordinated at the mersenneforum.[8]

Contents

  • Generalizations 1
    • Wilson primes of order n 1.1
    • Near-Wilson primes 1.2
    • Wilson numbers 1.3
  • See also 2
  • Notes 3
  • References 4
  • External links 5

Generalizations

Wilson primes of order n

Wilson's theorem can be expressed in general as (n-1)!(p-n)!=(-1)^n\ \bmod p for every prime p \le n. Generalized Wilson primes of order n are the primes p such that p^2 divides (n-1)!(p-n)! - (-1)^n.

It's a conjecture that for every natural number n, there are infinitely many Wilson primes of order n.

n prime p such that p^2 divides (n-1)!(p-n)! - (-1)^n OEIS sequence
1 5, 13, 563, ... A007540
2 2, 3, 11, 107, 4931, ... A079853
3 7, ...
4 10429, ...
5 5, 7, 47, ...
6 11, ...
7 17, ...
8 ...
9 541, ...
10 11, 1109, ...
11 17, 2713, ...
12 ...
13 13, ...
14 ...
15 349, ...
16 31, ...
17 61, 251, 479, ... A152413
18 13151527, ...
19 71, ...
20 59, 499, ...
21 217369, ...
22 ...
23 ...
24 47, 3163, ...
25 ...
26 97579, ...
27 53, ...
28 347, ...
29 ...
30 137, 1109, 5179, ...

Least generalized Wilson number of order n are

5, 2, 7, 10429, 5, 11, 17, ... (The next term > 1.4×107) (sequence A128666 in OEIS)

Near-Wilson primes

A prime p satisfying the congruence (p − 1)! ≡ − 1 + Bp mod p2 with small |B| can be called a near-Wilson prime. Near-Wilson primes with B = 0 represent Wilson primes. The following table lists all such primes with |B| ≤ 100 from 106 up to 4×1011:[2]

Wilson numbers

A Wilson number is a natural number n such that W(n) ≡ 0 (mod n2), where W(n) = \left(\prod_{1<=k<=n,gcd(k,n)=1}{k}\right)+e, the constant e = 1 if and only if n have a primitive root, otherwise, e = -1. For every natural number n, W(n) is divisible by n, and the quotients (called generalized Wilson quotients) are listed in  A157249. The Wilson numbers are

1, 5, 13, 563, 5971, 558771, 1964215, 8121909, 12326713, 23025711, 26921605, 341569806, 399292158, ... (sequence A157250 in OEIS)

If a Wilson number n is prime, then n is a Wilson prime. There are 13 Wilson numbers up to 5×108.[9]

See also

Notes

  1. ^  
  2. ^ a b A Search for Wilson primes Retrieved on November 2, 2012.
  3. ^ The Prime Glossary: Wilson prime
  4. ^  
  5. ^ A search for Wieferich and Wilson primes, p 443
  6. ^  
  7. ^ Ibercivis site
  8. ^ Distributed search for Wilson primes (at mersenneforum.org)
  9. ^ Agoh, Takashi; Dilcher, Karl;  

References

  • Beeger, N. G. W. H. (1913–1914). "Quelques remarques sur les congruences rp−1 ≡ 1 (mod p2) et (p − 1!) ≡ −1 (mod p2)".  
  • Goldberg, Karl (1953). "A table of Wilson quotients and the third Wilson prime".  
  •  
  • Crandall, Richard E.; Dilcher, Karl; Pomerance, Carl (1997). "A search for Wieferich and Wilson primes". Math. Comput. 66 (217): 433–449.  
  • Crandall, Richard E.; Pomerance, Carl (2001). Prime Numbers: A Computational Perspective. Springer-Verlag. p. 29.  
  • Pearson, Erna H. (1963). )"2p ≡ 1 (mod p−1 − 1)! ≡ −1 and 2p"On the Congruences ( (PDF). Math. Comput. 17: 194–195. 

External links

  • The Prime Glossary: Wilson prime
  • Weisstein, Eric W., "Wilson prime", MathWorld.
  • Status of the search for Wilson primes
  • "Wilson Quotients for composite moduli".  
  • On congruences involving Bernoulli numbers and the quotients of Fermat and Wilson
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.