ScholarLens Back to search
2016•International Journal of Mathematical ArchiveRequires access

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

Sayantan Khamaru, Saikat Sinha

Open publisher page 0 citations

Abstract

I n 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.

About this research paper

What this paper is about

I n 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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

I n 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.

Key concepts: Primality test, Prime (order theory), Countable set, Mathematics, Set (abstract data type), Prime number, Computer science, Simple (philosophy)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
• KHAMARU-SINHA PRIMALITY TEST, A NEW WAY FOR PRIME NUMBER TESTING — Research Paper | ScholarLens