Primality Test

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 equa tion 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 there fore vice versa to deduce if it is prime.