Leyland number

Last updated

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

Contents

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 (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 x1 + 1x. 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 prime. The first such primes are:

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

corresponding to

32+23, 92+29, 152+215, 212+221, 332+233, 245+524, 563+356, 3215+1532. [2]

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, ... ( OEIS:  A064539 ).

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. [3] In December 2012, this was improved by proving the primality of the two numbers 311063 + 633110 (5596 digits) and 86562929 + 29298656 (30008 digits), the latter of which surpassed the previous record. [4] In February 2023, 1048245 + 5104824 (73269 digits) was proven to be prime, [5] and it was also the largest prime proven using ECPP, until three months later a larger (non-Leyland) prime was proven using ECPP. [6] There are many larger known probable primes such as 3147389 + 9314738, [7] 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. [8]

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. 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 ). We can also consider 145 in the form of 4 to the power of 3 plus 4 to the power of 4.

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

Related Research Articles

In mathematics, a Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form Mn = 2n − 1 for some integer n. They are named after Marin Mersenne, a French Minim friar, who studied them in the early 17th century. If n is a composite number then so is 2n − 1. Therefore, an equivalent definition of the Mersenne primes is that they are the prime numbers of the form Mp = 2p − 1 for some prime p.

<span class="mw-page-title-main">Prime number</span> Number divisible only by 1 or itself

A prime number is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order.

In number theory, a prime number p is a Sophie Germain prime if 2p + 1 is also prime. The number 2p + 1 associated with a Sophie Germain prime is called a safe prime. For example, 11 is a Sophie Germain prime and 2 × 11 + 1 = 23 is its associated safe prime. Sophie Germain primes and safe primes have applications in public key cryptography and primality testing. It has been conjectured that there are infinitely many Sophie Germain primes, but this remains unproven.

In mathematics, a Fermat number, named after Pierre de Fermat (1607–1665), the first known to have studied them, is a positive integer of the form: where n is a non-negative integer. The first few Fermat numbers are: 3, 5, 17, 257, 65537, 4294967297, 18446744073709551617, ....

In recreational mathematics, a repunit is a number like 11, 111, or 1111 that contains only the digit 1 — a more specific type of repdigit. The term stands for "repeated unit" and was coined in 1966 by Albert H. Beiler in his book Recreations in the Theory of Numbers.

300 is the natural number following 299 and preceding 301.

118 is the natural number following 117 and preceding 119.

6000 is the natural number following 5999 and preceding 6001.

8000 is the natural number following 7999 and preceding 8001.

<span class="mw-page-title-main">1,000,000</span> Natural number

1,000,000, or one thousand thousand, is the natural number following 999,999 and preceding 1,000,001. The word is derived from the early Italian millione, from mille, "thousand", plus the augmentative suffix -one.

<span class="mw-page-title-main">1,000,000,000</span> Natural number

1,000,000,000 is the natural number following 999,999,999 and preceding 1,000,000,001. With a number, "billion" can be abbreviated as b, bil or bn.

100,000 (one hundred thousand) is the natural number following 99,999 and preceding 100,001. In scientific notation, it is written as 105.

10,000,000 is the natural number following 9,999,999 and preceding 10,000,001.

100,000,000 is the natural number following 99,999,999 and preceding 100,000,001.

In mathematics, the Mersenne conjectures concern the characterization of a kind of prime numbers called Mersenne primes, meaning prime numbers that are a power of two minus one.

60,000 is the natural number that comes after 59,999 and before 60,001. It is a round number. It is the value of (75025).

<span class="mw-page-title-main">Megaprime</span> Prime number with at least one million digits

A megaprime is a prime number with at least one million decimal digits.

In mathematics, elliptic curve primality testing techniques, or elliptic curve primality proving (ECPP), are among the quickest and most widely used methods in primality proving. It is an idea put forward by Shafi Goldwasser and Joe Kilian in 1986 and turned into an algorithm by A. O. L. Atkin in the same year. The algorithm was altered and improved by several collaborators subsequently, and notably by Atkin and François Morain, in 1993. The concept of using elliptic curves in factorization had been developed by H. W. Lenstra in 1985, and the implications for its use in primality testing followed quickly.

References

  1. ↑ Richard Crandall and Carl Pomerance (2005), Prime Numbers: A Computational Perspective, Springer
  2. ↑ "Primes and Strong Pseudoprimes of the form xy + yx". Paul Leyland. Archived from the original on 2007-02-10. Retrieved 2007-01-14.
  3. ↑ "Elliptic Curve Primality Proof". Chris Caldwell. Retrieved 2011-04-03.
  4. ↑ "Mihailescu's CIDE". mersenneforum.org. 2012-12-11. Retrieved 2012-12-26.
  5. ↑ "Leyland prime of the form 1048245+5104824". Prime Wiki. Retrieved 2023-11-26.
  6. ↑ "Elliptic Curve Primality Proof". Prime Pages. Retrieved 2023-11-26.
  7. 1 2 Henri Lifchitz & Renaud Lifchitz, PRP Top Records search.
  8. ↑ "Factorizations of xy + yx for 1 < y < x < 151". Andrey Kulsha. Retrieved 2008-06-24.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.