In number theory, a Leyland number is a number of the form where x and y are integers greater than 1. They are named after the mathematician Paul Leyland. The first few Leyland numbers are The requirement that x and y both be greater than 1 is important, since without it every positive integer would be a Leyland number of the form x1 + 1x. Also, because of the commutativeproperty of addition, the condition x ≥ y is usually added to avoid double-covering the set of Leyland numbers.
Leyland primes
A Leyland prime is a Leyland number that is also a prime. The first such primes are: corresponding to One can also fix the value of y and consider the sequence of x values that gives Leyland primes, for example x2 + 2x is prime for x = 3, 9, 15, 21, 33, 2007, 2127, 3759,.... By November 2012, the largest Leyland number that had been proven to be prime was 51226753 + 67535122 with 25050 digits. From January 2011 to April 2011, it was the largest prime whose primality was proved by elliptic curve primality proving. In December 2012, this was improved by proving the primality of the two numbers 311063 + 633110 and 86562929 + 29298656, the latter of which surpassed the previous record. There are many larger known probable primes such as 3147389 + 9314738, but it is hard to prove primality of large Leyland numbers. Paul Leyland writes on his website: "More recently still, it was realized that numbers of this form are idealtest cases for general purposeprimality proving programs. They have a simple algebraic description but no obvious cyclotomic properties which special purpose algorithms can exploit." There is a project called XYYXF to factorcomposite Leyland numbers.
Leyland number of the second kind
A Leyland number of the second kind is a number of the form where x and y are integers greater than 1. A Leyland prime of the second kind is a Leyland number of the second kind that is also prime. The first few such primes are: For the probable primes, see Henri Lifchitz & Renaud Lifchitz, PRP Top Records search.
