“Leyland number”的意思、由来-开放百科全书

词条

Leyland number

释义

Leyland primes
Leyland number of the second kind
References
External links

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

where x and y are integers greater than 1.^[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 {{OEIS|id=A076980}}.

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, ... {{OEIS|id=A094133}}

corresponding to

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

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, ... ({{OEIS2C|id=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.^[3] 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.^[4] There are many larger known probable primes such as 314738⁹ + 9³¹⁴⁷³⁸,^[5] 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.^[6]

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:

7, 17, 79, 431, 58049, 130783, 162287, 523927, 2486784401, 6102977801, 8375575711, 13055867207, 83695120256591, 375700268413577, 2251799813682647, ... {{OEIS|id=A123206}}

For the probable primes, see Henri Lifchitz & Renaud Lifchitz, PRP Top Records search.^[7]

References

1. ^{{citation |author=Richard Crandall and Carl Pomerance |title=Prime Numbers: A Computational Perspective |publisher=Springer |year=2005}}
2. ^{{cite web |title=Primes and Strong Pseudoprimes of the form x^y + y^x |url=http://www.leyland.vispa.com/numth/primes/xyyx.htm |publisher=Paul Leyland |accessdate=2007-01-14}}
3. ^{{cite web |title=Elliptic Curve Primality Proof |url=http://primes.utm.edu/top20/page.php?id=27 |publisher=Chris Caldwell |accessdate=2011-04-03}}
4. ^{{cite web | title = Mihailescu's CIDE | publisher = mersenneforum.org | date = 2012-12-11 | url = http://mersenneforum.org/showthread.php?t=17554 | accessdate = 2012-12-26}}
5. ^Henri Lifchitz & Renaud Lifchitz, PRP Top Records search.
6. ^{{cite web |title=Factorizations of x^y + y^x for 1 < y < x < 151 |url=http://www.primefan.ru/xyyxf/default.html |publisher=Andrey Kulsha |accessdate=2008-06-24}}
7. ^Henri Lifchitz & Renaud Lifchitz, PRP Top Records search

External links

{{YouTube | id= Lsu2dIr_c8k | title= Leyland Numbers - Numberphile }}

1 : Integer sequences

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。