There are infinitely many Perrin pseudoprimes

DOI10.1016/j.jnt.2009.11.008zbMath1216.11110arXiv1903.06825OpenAlexW2127679104WikidataQ56657600 ScholiaQ56657600MaRDI QIDQ971844

Jon Grantham

Publication date: 17 May 2010

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.06825

zbMATH Keywords

pseudoprimeHecke L-functionFrobenius pseudoprimePerrin pseudoprime

Mathematics Subject Classification ID

Primes in congruence classes (11N13) Distribution of integers with specified multiplicative constraints (11N25) Primality (11Y11)

Related Items (9)

Carmichael numbers and the sieve ⋮ Pseudoprimality related to the generalized Lucas sequences ⋮ On the distribution of balanced subgroups ⋮ Frobenius pseudoprimes ⋮ Unnamed Item ⋮ Carmichael numbers with a totient of the form \(a^2+nb^2\) ⋮ Linear recurrence sequences satisfying congruence conditions ⋮ Average liar count for degree-$2$ Frobenius pseudoprimes ⋮ Primality tests, linear recurrent sequences and the Pell equation

Uses Software

• ECPP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• There are infinitely many Carmichael numbers
• Primality testing with Gaussian periods
• PRIMES is in P
• Frobenius pseudoprimes
• Pseudoprimes for Higher-Order Linear Recurrence Sequences
• Proving primality in essentially quartic random time
• Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
• Strong Primality Tests that are Not Sufficient
• A Rigorous Time Bound for Factoring Integers
• On the zeros of Heck's $L$-funcions
• On the zeros of L-functions
• ERROR TERMS IN ADDITIVE PRIME NUMBER THEORY

This page was built for publication: There are infinitely many Perrin pseudoprimes