Leyland number
From Wikipedia, the free encyclopedia
In number theory, a Leyland number is a number of the form xy + yx, where x and y are natural numbers with 1 < x ≤ y. The first few Leyland numbers are
8, 17, 32, 54, 57, 100, 145, 177, 320, 368, 512, 593, 945, 1124 (sequence A076980 in OEIS)
Because of the commutative property of addition, the condition x ≤ y could be replaced with 1 < y without changing the set of Leyland numbers. The requirement that x and y both be greater than 1, however, is important, since without it every positive integer would be a Leyland number of the form 1y + y1.
The first Leyland numbers that are also prime are listed in A094133. As of January 2007, the largest Leyland number that has been proven to be prime is 26384405 + 44052638. From July 2004 to June 2006 it was the largest proof by Elliptic curve primality proving. [1] There are many larger known probable primes, but it is hard to prove primality of Leyland numbers. Paul Leyland writes on his website: "More recently still, it was realized that numbers of this form are ideal test cases for general purpose primality proving programs. They have a simple algebraic description but no obvious cyclotomic properties which special purpose algorithms can exploit."
[edit] References
- Richard Crandall and Carl Pomerance, Prime Numbers : A Computational Perspective, Springer, 2005
- Paul Leyland, Primes and Strong Pseudoprimes of the form xy + yx. Retrieved on January 14, 2007.
 |
This number theory-related article is a stub. You can help Wikipedia by expanding it. |
