Lucas sequence: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Karsten Meyer
(New page: '''Lucas sequences''' are the particular generalisation of sequences like Fibonacci numbers, Lucas numbers, Pell numbers or [[Jacobsth...)
 
imported>Karsten Meyer
mNo edit summary
Line 27: Line 27:
Is the natural number <math>p\ </math> a [[Prime number]], then it is true, that
Is the natural number <math>p\ </math> a [[Prime number]], then it is true, that
*<math>p\ </math> divides <math>U_p(P,Q)-\left(\frac Dp\right)</math>
*<math>p\ </math> divides <math>U_p(P,Q)-\left(\frac Dp\right)</math>
*<math>p\ </math> divides <math>V_p(P,Q)-\P </math>
*<math>p\ </math> divides <math>V_p(P,Q)-P\ </math>


Fermat's little theorem you can see as a special case of <math>p\ </math> divides <math>(V_n(P,Q) - P)\ </math> because <math>a^p \equiv a \mod p</math> is äquivalent to <math>V_p(a+1,a) \equiv V_1(a+1,a) \mod p</math>
Fermat's little theorem you can see as a special case of <math>p\ </math> divides <math>(V_n(P,Q) - P)\ </math> because <math>a^p \equiv a \mod p</math> is äquivalent to <math>V_p(a+1,a) \equiv V_1(a+1,a) \mod p</math>


The converse (If <math>n\ </math> divides <math>U_n(P,Q)-\left(\frac Dn\right)</math> then is <math>n\ </math> a prime number and if <math>m\ </math> divides <math>V_m(P,Q)-\P </math> then is <math>m\ </math> a prime number) is false and lead to [[Fibonacci pseudoprime|Fibonacci pseudoprimes]] respectively to [[Lucas pseudoprime|Lucas pseudoprimes]].
The converse (If <math>n\ </math> divides <math>U_n(P,Q)-\left(\frac Dn\right)</math> then is <math>n\ </math> a prime number and if <math>m\ </math> divides <math>V_m(P,Q)-P\ </math> then is <math>m\ </math> a prime number) is false and lead to [[Fibonacci pseudoprime|Fibonacci pseudoprimes]] respectively to [[Lucas pseudoprime|Lucas pseudoprimes]].


== Further reading ==
== Further reading ==

Revision as of 22:12, 15 November 2007

Lucas sequences are the particular generalisation of sequences like Fibonacci numbers, Lucas numbers, Pell numbers or Jacobsthal numbers. Every of this sequences has one common factor. They could be generatet over quadratic equatations of the form: .

There exists kinds of Lucas sequences:

  • Sequence with
  • Sequence with

and are the solutions and of the quadratic equatation .

Properties

  • The variables and , and the parameter and are interdependent. So it is true, that and .
  • For very sequence is it true, that and .
  • For very sequence is it true, that and .

For every Lucas sequence is true that

  • ; für alle

Fibonacci numbers and Lucas numbers

The both best-known Lucas sequences are the Fibonacci numbers and the Lucas numbers with and .

Lucas sequences and the Prime numbers

Is the natural number a Prime number, then it is true, that

  • divides
  • divides

Fermat's little theorem you can see as a special case of divides because is äquivalent to

The converse (If divides then is a prime number and if divides then is a prime number) is false and lead to Fibonacci pseudoprimes respectively to Lucas pseudoprimes.

Further reading