A generalization of Miller’s primality theorem

DOI10.1090/S0002-9939-08-09303-9MaRDI QIDQ3522306zbMATH OpenFDO

Authors Pedro Berrizbeitia, Aurora Olivieri

Publication date 1 September 2008

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

Primality (11Y11)

Recommendations

• Generalized strong pseudoprime tests and applications
• Recent developments in primality testing
• A probable prime test with very high confidence for \(n \equiv 3\mod4\)
• scientific article; zbMATH DE number 2081060
• scientific article; zbMATH DE number 697832

Cites work

• scientific article; zbMATH DE number 3912454 (Why is no real title available?)
• A Fast Monte-Carlo Test for Primality
• A probable prime test with high confidence
• Evaluation and comparison of two efficient probabilistic primality testing algorithms
• Generalized strong pseudoprime tests and applications
• It is easy to determine whether a given integer is prime
• PRIMES is in P
• Probabilistic algorithm for testing primality
• Riemann's hypothesis and tests for primality
• Sharpening ``Primes is in P for a large family of numbers
• The least quadratic non residue

Cited in

(8)

• Miller's primality test
• Conjectured polynomial time primality tests for numbers of special forms
• Generalized strong pseudoprime tests and applications
• scientific article; zbMATH DE number 4006351 (Why is no real title available?)
• A primality test for \(Kp^{n}+1\) numbers
• Strong pseudoprimes to base 2
• A generalization of a necessary and sufficient condition for primality due to Vantieghem
• On the effectiveness of a generalization of Miller's primality theorem

This page was built for publication: A generalization of Miller’s primality theorem

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