Primality Test
Gabriele Martino
Via Cornelia, Rome, Italy.
DOI: 10.4236/ajcm.2013.31009   PDF   HTML     3,745 Downloads   5,807 Views  

Abstract

In this paper we will give an algorithm that in the worst case solve the question about the primality of a number in but that gives better result if the number is not prime (constant operation). Firstly, we will introduce an equation on which are based not prime numbers. With this equation it is possible to deduce the prime number that generates a not prime number and to establish an equation in which if exists a certain integer the number is not prime and therefore vice versa to deduce if it is prime.

Share and Cite:

G. Martino, "Primality Test," American Journal of Computational Mathematics, Vol. 3 No. 1, 2013, pp. 59-60. doi: 10.4236/ajcm.2013.31009.

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1] S. Aaronson, “The Prime Facts: From Euclid to AKS,” Lecture Notes, 2003.
[2] Wikipedia. http://en.wikipedia.org/wiki/Primality_test
[3] Wikipedia. http://en.wikipedia.org/wiki/AKS_primality_test
[4] Wikipedia. http://en.wikipedia.org/wiki/L'Hopital's Rule

Copyright © 2021 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.