A generalization of Miller’s primality theorem-Reference-Cited by-同舟云学术

A generalization of Miller’s primality theorem

Published:2008-05-07 Issue:9 Volume:136 Page:3095-3104
ISSN:0002-9939
Container-title:Proceedings of the American Mathematical Society
language:en
Short-container-title:Proc. Amer. Math. Soc.

Author:

Berrizbeitia Pedro,Olivieri Aurora

Abstract

For any integer r r we show that the notion of ω \omega -prime to base a a introduced by Berrizbeitia and Berry, 2000, leads to a primality test for numbers n n congruent to 1 1 modulo r r , which runs in polynomial time assuming the Extended Riemann Hypothesis (ERH). For r = 2 r = 2 we obtain Miller’s classical result.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/proc/2008-136-09/S0002-9939-08-09303-9/S0002-9939-08-09303-9.pdf

Reference12 articles.

1. Agrawal, M., Kayal, N., and Saxena, N. “Primes in P.” Preprint, Aug. 6, 2002. http://www.cse.iitk.ac.in/users/manindra/publications.html.

2. The least quadratic non residue;Ankeny, N. C.;Ann. of Math. (2),1952

3. ACM Distinguished Dissertations;Bach, Eric,1985

4. Sharpening “PRIMES is in 𝑃” for a large family of numbers;Berrizbeitia, Pedro;Math. Comp.,2005

5. Generalized strong pseudoprime tests and applications;Berrizbeitia, Pedro;J. Symbolic Comput.,2000

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Analytical Properties of Prime Numbers;Numerical Simulation - Advanced Techniques for Science and Engineering;2023-11-15

2. Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime Test;Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation;2016-07-20

3. A primality test for ⁿ+1 numbers;Mathematics of Computation;2014-06-10

4. On the effectiveness of a generalization of Miller’s primality theorem;Journal of Complexity;2010-04