scientific article; zbMATH DE number 17624

Congruences; primitive roots; residue systems (11A07) Factorization; primality (11A51) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Review text

[For the entire collection see Zbl 0725.00005.] Let \(\{L_ n\}\) be the sequence of Lucas numbers. It is a well-known fact that (*) \(L_ n\equiv 1 \pmod n\) for any odd prime \(n\). The composite positive integer \(M\) is called a Fibonacci pseudoprime (FPSP) if the congruence (*) is satisfied with \(n=M\) [see \textit{A. Di Porto} and \textit{P. Filipponi}, Fibonacci Q. 27, No. 3, 232-242 (1989; Zbl 0678.10009) for a list of all FPSP's up to 1,000,000]. All these are odd numbers. It is conjectured that there are no even FPSP's. The present paper contains many constraints on the existence of even FPSP's, which are expressed in terms of limitations on the sets of possible prime divisors of such numbers. Utilizing these constraints in a computer search led to the following result: the smallest prime divisor of an even FPSP is larger than 3,797,117.

Cited in

(10)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3974950)