Using Fibonacci factors to create Fibonacci pseudoprimes

MaRDI QIDQ6368762arXivFDO

Authors John Greene, Junhyun Lim, Shaunak Mashalkar, Edward F. Schaefer

Publication date 27 May 2021

Published in arXiv

Mathematics Subject Classification ID

Factorization; primality (11A51) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Primality (11Y11)

arXiv classification

math.NT

Abstract: Carmichael showed for sufficiently large $L$, that $F_L$ has at least one prime divisor that is $pm1(mmod,L)$. For a given $F_L$, we will show that a product of distinct odd prime divisors with that congruence condition is a Fibonacci pseudoprime. Such pseudoprimes can be used in an attempt, here unsuccessful, to find an example of a Baillie-PSW pseudoprime, i.e. an odd Fibonacci pseudoprime that is congruent to $pm2(mmod,5)$ and is also a base-2 pseudoprime.

This page was built for publication: Using Fibonacci factors to create Fibonacci pseudoprimes

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