Open AccessPrimality Test
Author(s) -
Gabriele Martino
Publication year - 2013
Publication title -
american journal of computational mathematics
Language(s) - English
Resource type - Journals
eISSN - 2161-1211
pISSN - 2161-1203
DOI - 10.4236/ajcm.2013.31009
Subject(s) - primality test , mathematics , prime (order theory) , prime number , integer (computer science) , constant (computer programming) , prime factor , discrete mathematics , computer science , combinatorics , programming language
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.