• KHAMARU-SINHA PRIMALITY TEST, A NEW WAY FOR PRIME NUMBER TESTING

Abstract

In the infinite set of Natural Numbers there are countable infinite prime numbers exists. We do not know exactly how many are there but, what we can do to create a sub-set to put all the prime numbers from the Natural Number set into the Prime Number sub-set. Therefore, there are some prime number testing methodologies are required and eventually there are many Primality testing methods are available. But, all this existing methods are very slow to process for the computers here we will see how a fast and easy method can be implemented in this paper by using only the digit sum(s) of the input or, given number. Our goal is not only the fast computers but also a common man can say that if a number is prime or not by simple usage of pen and paper within no time and very few steps.