A generalization of Miller’s primality theorem

DOI10.1090/S0002-9939-08-09303-9zbMATH Open1156.11047MaRDI QIDQ3522306FDOQ3522306

Authors: Pedro Berrizbeitia, Aurora Olivieri 

Publication date: 1 September 2008

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

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

Mathematics Subject Classification ID

Primality (11Y11)

Cites Work

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

Cited In (8)

• Strong pseudoprimes to base 2
• On the effectiveness of a generalization of Miller's primality theorem
• Generalized strong pseudoprime tests and applications
• Miller's primality test
• Title not available (Why is that?)
• A generalization of a necessary and sufficient condition for primality due to Vantieghem
• Conjectured polynomial time primality tests for numbers of special forms
• A primality test for \(Kp^{n}+1\) numbers

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)