LUCAS PSEUDOPRIME
In mathematics, 'Lucas pseudoprimes' in number theory are defined in terms of Lucas sequences. Suppose that
:
is a Lucas sequence, and ''D'' is the discriminant for the sequence. If ''p'' is an odd prime number for which the Jacobi symbol
:,
then ''p'' is a factor of ''Up-k''. However, there are also composite numbers satisfying this condition. These numbers are called Lucas pseudoprimes, named by analogy with pseudoprimes.
In the specific case of the Fibonacci sequence, where ''D'' = 5, the first pseudoprimes are 323 and 377; (5/323) and (5/377) are both −1, the 324th Fibonacci number is a multiple of 323, and the 378th is a multiple of 377.
:
is a Lucas sequence, and ''D'' is the discriminant for the sequence. If ''p'' is an odd prime number for which the Jacobi symbol
:,
then ''p'' is a factor of ''Up-k''. However, there are also composite numbers satisfying this condition. These numbers are called Lucas pseudoprimes, named by analogy with pseudoprimes.
In the specific case of the Fibonacci sequence, where ''D'' = 5, the first pseudoprimes are 323 and 377; (5/323) and (5/377) are both −1, the 324th Fibonacci number is a multiple of 323, and the 378th is a multiple of 377.
This article provided by Wikipedia. To edit the contents of this article, click here for original source.
psst.. try this: add to faves

العربية
中国
Français
Deutsch
Ελληνική
हिन्दी
Italiano
日本語
Português
Русский
Español