article · American Journal of Computational Mathematics · 2013

Primality Test

Cited by 0Open access

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.

Cite this paper

APA 7

Martino, G. (2013). Primality Test. American Journal of Computational Mathematics, 03(01), 59–60. https://doi.org/10.4236/ajcm.2013.31009

MLA 9

Martino, Gabriele. “Primality Test.” American Journal of Computational Mathematics, vol. 03, no. 01, 2013, pp. 59–60, https://doi.org/10.4236/ajcm.2013.31009.

Chicago

Martino, Gabriele. 2013. “Primality Test.” American Journal of Computational Mathematics 03 (01): 59–60. https://doi.org/10.4236/ajcm.2013.31009.

Harvard

Martino, G. (2013) ‘Primality Test’, American Journal of Computational Mathematics, 03(01), pp. 59–60. Available at: https://doi.org/10.4236/ajcm.2013.31009.

BibTeX

@article{martino2013primality,
  title = {{Primality Test}},
  author = {Martino, Gabriele},
  journal = {American Journal of Computational Mathematics},
  volume = {03},
  number = {01},
  pages = {59--60},
  year = {2013},
  doi = {10.4236/ajcm.2013.31009}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.