Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.

A Novel Algorithmic Approach using Little Theorem of Fermat For Generating Primes and Poulet Numbers in Order


Computer encryption are based mostly on primes, which are also vital for communications. The aim of this paper is to present a new explicit strategy for creating all primes and Poulet numbers in order up to a certain number by using the Fermats little theorem. For this purpose, we construct a set C of odd composite numbers and transform Fermats little theorem from primality test of a number to a generating set Q of odd primes and Poulet numbers. The set Q is sieved to separate the odd primes and the Poulet numbers. By this method, we can obtain all primes and Poulet numbers in order up to a certain number. Also, we obtain a closed form expression which precisely gives the number of primes up to a specific number. The pseudo-code of the proposed method is presented

Similar works

This paper was published in Arab Journals Platform.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.