Tabulating Absolute Lucas Pseudoprimes

MaRDI QIDQ6442126zbMATH OpenFDO

Authors Chloe Helmreich, Jonathan Webster

Publication date 30 June 2023

Mathematics Subject Classification ID

Elementary number theory (11Axx)

Abstract: In 1977, Hugh Williams studied Lucas pseudoprimes to all Lucas sequences of a fixed discriminant. These are composite numbers analogous to Carmichael numbers and they satisfy a Korselt-like criterion: $n$ must be a product of distinct primes and $p_i-delt{a}_{p_i}|n-delt{a}_n$ where $delt{a}_n$ is a Legendre symbol with the first argument being the discriminant of the Lucas sequence. Motivated by tabulation algorithms for Carmichael numbers, we give algorithms to tabulate these numbers and provide some asymptotic analysis of the algorithms. We show that there are only finitely many absolute Lucas pseudoprimes $n=pro{d}_{i=1}^k{p}_i$ with a given set of $k-2$ prime factors. We also provide the first known tabulation for discriminant $5$.

Recommendations

• Primitive Lucas d-pseudoprimes and Carmichael–Lucas numbers
• scientific article; zbMATH DE number 3991582
• Lucas pseudoprimes of special types
• Fast tabulation of challenge pseudoprimes
• scientific article; zbMATH DE number 579183

Cited in

(2)

• Fast tabulation of challenge pseudoprimes
• On absolute Lucas pseudoprimes

This page was built for publication: Tabulating Absolute Lucas Pseudoprimes

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