Lucas pseudoprimes and Fibonacci pseudoprimes are composite integers that pass certain tests which all primes and very few composite numbers pass: in this case, criteria relative to some Lucas sequence. == Baillie-Wagstaff-Lucas pseudoprimes == Baillie and Wagstaff define Lucas pseudoprimes as follows: Given integers P and Q, where P > 0 and D = P 2 − 4 Q {\displaystyle D=P^{2}-4Q} , let Uk(P, Q) and Vk(P, Q) be the corresponding Lucas sequences.
Lucas pseudoprimes and Fibonacci pseudoprimes are composite integers that pass certain tests which all primes and very few composite numbers pass: in this case, criteria relative to some Lucas sequence. == Baillie-Wagstaff-Lucas pseudoprimes == Baillie and Wagstaff define Lucas pseudoprimes as follows: Given integers P and Q, where P > 0 and D = P 2 − 4 Q {\displaystyle D=P^{2}-4Q} , let Uk(P, Q) and Vk(P, Q) be the corresponding Lucas sequences.
Source: Wikipedia "Lucas pseudoprime" · CC BY-SA 4.0
Share this article: X · Bluesky