Looking for Fibonacci Base-2 Pseudoprimes
Department or Administrative Unit
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 1015 which are congruent to 2 or 3 (modulo 5).
Monfre, D. J., & Klyve, D. (2012). Looking for Fibonacci Base-2 Pseudoprimes. Missouri Journal of Mathematical Sciences, 24(2). https://doi.org/10.35834/mjms/1352138559
Missouri Journal of Mathematical Sciences
Copyright © 2012 Central Missouri State University, Department of Mathematics and Computer Science