Open Access
November 2012 Looking for Fibonacci Base-2 Pseudoprimes
Daniel J. Monfre, Dominic Klyve
Missouri J. Math. Sci. 24(2): 116-123 (November 2012). DOI: 10.35834/mjms/1352138559


In this paper, we examine computationally the results of combining two well-known, simple, and imperfect tests for primality: the Fermat base-2 test, and the Fibonacci test. Although considerable attention has been paid to various properties of composite integers which pass the base-2 test (base-2 pseudoprimes), no comparable study of Fibonacci and base-2 Fibonacci tests exists in the literature. Our study tabulates various empirical properties of these numbers. Among other things, we conclude that there are no base-2 Fibonacci pseudoprimes less than $10^{15}$ which are congruent to 2 or 3 (modulo 5).


Download Citation

Daniel J. Monfre. Dominic Klyve. "Looking for Fibonacci Base-2 Pseudoprimes." Missouri J. Math. Sci. 24 (2) 116 - 123, November 2012.


Published: November 2012
First available in Project Euclid: 5 November 2012

zbMATH: 1260.11077
MathSciNet: MR3052411
Digital Object Identifier: 10.35834/mjms/1352138559

Primary: 11A41
Secondary: 11Y11

Rights: Copyright © 2012 Central Missouri State University, Department of Mathematics and Computer Science

Vol.24 • No. 2 • November 2012
Back to Top