Leyland number

In number theory, a Leyland number is a number of the form

$x^{y}+y^{x}$

where x and y are integers greater than 1. They are named after the mathematician Paul Leyland. The first few Leyland numbers are

8, 17, 32, 54, 57, 100, 145, 177, 320, 368, 512, 593, 945, 1124 (sequence A076980 in the OEIS).

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 x¹ + 1^x. Also, because of the commutative property of addition, the condition x ≥ y is usually added to avoid double-covering the set of Leyland numbers (so we have 1 < y ≤ x).

Leyland primes

A Leyland prime is a Leyland number that is also a prime. The first such primes are:

17, 593, 32993, 2097593, 8589935681, 59604644783353249, 523347633027360537213687137, 43143988327398957279342419750374600193, ... (sequence A094133 in the OEIS)

corresponding to

3²+2³, 9²+2⁹, 15²+2¹⁵, 21²+2²¹, 33²+2³³, 24⁵+5²⁴, 56³+3⁵⁶, 32¹⁵+15³².

One can also fix the value of y and consider the sequence of x values that gives Leyland primes, for example x² + 2^x is prime for x = 3, 9, 15, 21, 33, 2007, 2127, 3759, ... (OEIS: A064539).

By November 2012, the largest Leyland number that had been proven to be prime was 5122⁶⁷⁵³ + 6753⁵¹²² 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 3110⁶³ + 63³¹¹⁰ (5596 digits) and 8656²⁹²⁹ + 2929⁸⁶⁵⁶ (30008 digits), the latter of which surpassed the previous record. There are many larger known probable primes such as 314738⁹ + 9³¹⁴⁷³⁸, 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 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."

There is a project called XYYXF to factor composite Leyland numbers.

Currently, the largest known probable Leyland prime is 81650⁵⁴³⁶⁹+54369⁸¹⁶⁵⁰ (386,642 digits). This probable prime was found by Yusuf AttarBashi, in June 2021.

Leyland number of the second kind

A Leyland number of the second kind is a number of the form

$x^{y}-y^{x}$

where x and y are integers greater than 1. The first such numbers are:

0, 1, 7, 17, 28, 79, 118, 192, 399, 431, 513, 924, 1844, 1927, 2800, 3952, 6049, 7849, 8023, 13983, 16188, 18954, 32543, 58049, 61318, 61440, 65280, 130783, 162287, 175816, 255583, 261820, ... (sequence A045575 in the OEIS)

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:

7, 17, 79, 431, 58049, 130783, 162287, 523927, 2486784401, 6102977801, 8375575711, 13055867207, 83695120256591, 375700268413577, 2251799813682647, ... (sequence A123206 in the OEIS)

For the probable primes, see Henri Lifchitz & Renaud Lifchitz, PRP Top Records search.

List

3^# + 3^#

Leyland number	xy + yx equivalent
8	22 + 22
12	22 + 23
16	23 + 23
24	23 + 24
32	24 + 24
48	24 + 25
64	25 + 25
96	25 + 26
128	26 + 26
192	26 + 27
256	27 + 27
384	27 + 28
512	28 + 28
768	28 + 29
1024	29 + 29
1536	29 + 210
2048	210 + 210

External links

• Leyland Numbers - Numberphile on YouTube

Leyland number	xy + yx equivalent
18	32 + 32
36	32 + 33
54	33 + 33
108	33 + 34
162	34 + 34
324	34 + 35
486	35 + 35
972	35 + 36
1458	36 + 36
2916	36 + 37
4374	37 + 37
8748	37 + 38
13122	38 + 38
26244	38 + 39
39366	39 + 39
78732	39 + 310
118098	310 + 310