Lucas episode

from Wikipedia, the free encyclopedia

The Lucas sequence is understood to mean two different things:

  • On the one hand the sequence of the Lucas numbers
2, 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, 199, 322, 521, 843, 1364, 2207, 3571, 5778, 9349, 15127, ... (sequence A000032 in OEIS )
where each term in the sequence (from the third) on is the sum of the two preceding ones.
  • On the other hand, the two general Lucas sequences and , which are defined depending on the parameters and as those sequences which
or.
meet and the recursion formulas
or.
for enough.

The Lucas sequences are named after the French mathematician Édouard Lucas , who was the first to study them.

Examples

  • Be and . Then the following sequence is:
In short one gets the Fibonacci sequence :
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, ... (sequence A000045 in OEIS )
  • Be and . Then the following sequence is:
In short, you get a sequence that is also called a special Lucas sequence (or even more simply just a Lucas sequence ), namely:
2, 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, 199, 322, 521, 843, 1364, 2207, 3571, 5778, 9349, 15127, 24476, 39603, 64079, 103682, ... (Follow A000032 in OEIS )
The individual numbers in this sequence are called Lucas numbers , which will be discussed in more detail below .
  • Summarized in a table you get for certain start values ​​for and the table in the section special cases .

Explicit formulas

preparation

To determine the terms of the general Lucas sequence, the associated quadratic equation must be solved in advance.

The two solutions and the quadratic equation are required for the explicit formulas . It is this

and

If one of the two complex roots is to be chosen. Which of the two numbers and which is mentioned is irrelevant here.

The parameters and and the values and are interdependent; the reverse applies

( Theorem of Vieta )

The formulas for and can be generalized in relation to the powers. The following applies:

The general Lucas episodes

If the following applies, or equivalent: if the numbers and are different, the term of the general Lucas sequence is calculated using the following formula:

for everyone . In special cases it applies instead

The term in the general Lucas sequence is calculated using the following formula:

for all

Relationships between the members

A selection of the relationships between the sequence members is:

  • if
  • ; for all

Special cases

There are a few special cases that lead to consequences that play an important role in mathematics and therefore even have their own names:


(Follow A000045 in OEIS )
( Fibonacci sequence )

(Sequence A000032 in OEIS )
((special) Lucas sequence)

(Episode A001045 in OEIS )
( Jacobsthal episode)

(Episode A014551 in OEIS )
(Jacobsthal-Lucas episode)

(Episode A000129 in OEIS )
( Pell episode )

(Episode A002203 in OEIS )
(Companion Pell episode, Pell-Lucas episode)

(Sequence A000225 in OEIS )
( Mersenne number sequence)

(Follow A000051 in OEIS )
(Numbers of the form (contain the Fermat numbers ))
Fibonacci polynomials Lucas polynomials
Chebyshev polynomials of the second kind Chebyshev polynomials of the first kind, multiplied by
with repunits to base A
-Episode

But there are also many other special cases that lead to consequences that have an OEIS entry and thus also play a certain role in mathematics. Here are a few examples:


(Follow A128834 in OEIS )

(Follow A087204 in OEIS )

(Follow A107920 in OEIS )

(Follow A002249 in OEIS )

(Follow A001477 in OEIS )

(Follow A007395 in OEIS )

(Follow A009545 in OEIS )

(Follow A009545 in OEIS )

(Follow A088137 in OEIS )

(Follow A088138 in OEIS )

(Follow A045873 in OEIS )

(Follow A015528 in OEIS )

(Follow A015523 in OEIS )

(Follow A072263 in OEIS )

(Follow A015521 in OEIS )

(Follow A201455 in OEIS )

(Follow A030195 in OEIS )

(Follow A172012 in OEIS )

(Follow A007482 in OEIS )

(Follow A206776 in OEIS )

(Follow A006190 in OEIS )

(Follow A006497 in OEIS )

(Follow A001906 in OEIS )

(Follow A005248 in OEIS )

(Follow A0190959 in OEIS )

(Follow A015531 in OEIS )

(Follow A087404 in OEIS )

(Follow A015530 in OEIS )

(Follow A080042 in OEIS )

(Follow A090017 in OEIS )

(Follow A001076 in OEIS )

(Follow A014448 in OEIS )

(Follow A001353 in OEIS )

(Follow A003500 in OEIS )

(Follow A007070 in OEIS )

(Follow A056236 in OEIS )

(Follow A003462 in OEIS )

(Follow A034472 in OEIS )

(Follow A001787 in OEIS )

(Follow A000079 in OEIS )

(Follow A015540 in OEIS )

(Follow A0274074 in OEIS )

(Follow A015536 in OEIS )

(Follow A015535 in OEIS )

(Follow A052918 in OEIS )

(Follow A087130 in OEIS )

(Follow A004254 in OEIS )

(Follow A003501 in OEIS )

(Follow A002450 in OEIS )

(Follow A052539 in OEIS )

(Follow A015577 in OEIS )

The general Lucas sequences U (P, Q) , V (P, Q) and the prime numbers

The general Lucas sequences and have a special property for integer parameters and with regard to the divisibility by prime numbers. This property was used for methods to determine the primality of a number (see also Lucas-Lehmer test ).

The sequences U (P, Q)

The following applies to all Lucas episodes :

If p is a prime number, then it is divisible by p .

It is the Legendre symbol .

There are also composite numbers that meet this condition. These numbers are called Lucas pseudoprimes .

The sequences V (P, Q)

The following applies to all Lucas episodes :

If p is a prime number, then by divisible.

A composite number that fulfills this condition (in the case of and ) is called a Fibonacci pseudoprime number .

The divisibility condition is particularly interesting for the sequence . The following applies to this sequence:

If is a prime number then: divides .

This is a special form of the little Fermatschen theorem .

The same applies here .

The special Lucas series

The generally known Lucas-Sequence Sequence of Lucas numbers 2, 1, 3, 4, 7, 11, 18, 29, ... can be other than by the recursion with the initial values and also generate, as follows:

  1. As mentioned in the general case for the consequences , about Binet's formula (after Jacques Philippe Marie Binet ):
    , there and applies. By the way, a is the golden number .
  2. Another recursive formula (with Gaussian brackets ):
  3. As the sum of two terms of the Fibonacci sequence :
    .

Alternatively, you can also write according to 1) . As for the amount of is always less than 0.5, there is the property that the th ( ) Luca number the rounded value of the Golden number to the power of equal to: .

Reciprocal series

The limit of the absolutely converging reciprocal series of special Lucas numbers

is irrational .

Lucas prime numbers

A Lucas prime is a Lucas number that is prime. The smallest Lucas prime numbers are:

2, 3, 7, 11, 29, 47, 199, 521, 2207, 3571, 9349, 3010349, 54018521, 370248451, 6643838879, 119218851371, 5600748293801, 688,846,502,588,399, 32361122672259149, 412670427844921037470771 ... (sequence A005479 in OEIS )

For this Lucas primes the index of the following:

0, 2, 4, 5, 7, 8, 11, 13, 16, 17, 19, 31, 37, 41, 47, 53, 61, 71, 79, 113, 313, 353, 503, 613, 617, 863, 1097, 1361, 4787, 4793, 5851, 7741, 8467, 10691, 12251, 13963, 14449, 19469, 35449, 36779, 44507, 51169, 56003, 81671, 89849, 94823, 140057, 148091, 159521, 183089, 193201, 202667, 344293, 387433, 443609, 532277, 574219, 616787, 631181, 637751, 651821, 692147, 901657, 1051849, ... (sequence A001606 in OEIS )
Example:
It is and . Thus is a prime number. In fact, the index appears in the list above in the 5th position because it leads to the fifth smallest Lucas prime number .

The following two properties apply to Lucas prime numbers:

  • If is a prime, then the index is either equal to, or even prime, or a power of two .
  • is a prime number for . No other prime numbers are obtained for any other known values ​​of .

It is believed that there are infinitely many Lucas primes.

See also

literature

Web links

Individual evidence

  1. See Ribenboim: The World of Prime Numbers , pp. 44–70.
  2. See the chapter already mentioned in the book by Ribenboim.
  3. Paulo Ribenboim: My Numbers, My Friends: Highlights of Number Theory. Springer textbook, 2009, ISBN 978-3-540-87955-8 , p. 323.
  4. a b Chris K. Caldwell: Lucas prime. Prime Pages, accessed March 1, 2020 .