Prime Generating Algorithms by Skipping Composite Divisors
Journal Title: International Journal of Computer Science & Engineering Technology - Year 2014, Vol 5, Issue 9
Abstract
Three elementary versions of simple prime generating sieves have already been improved by skipping even divisors other than 2. All composite integers are multiples of primes. Taking help of the transitivity property of divisibility allows using the logic that if a prime doesn’t divide a number, then any composite number which is multiple of that prime also cannot divide it. That altogether eliminates the necessity of trying composite numbers for divisibility in primality tests and gives the next generation of prime generating sieves. In fact, the best version of this generation happens to be the celebrated and historic Sieve of Eratosthenes.
Authors and Affiliations
Neeraj Anant Pande
Keywords
Related Articles
- EP ID EP116294
- DOI -
- Views 118
- Downloads 0
Secret Detection of Sensitive Data Leakage
Surveys from many years have shown that many data leakages has been found due different problems like malicious attacks, hacking, different attacks. Approximately 28% of all data leakages are due to human mistakes which...
On Demand Routing Protocols in Mobile Ad-hoc Networks: Literature Review
Routing in MANETs may be a difficult task and has received an amazing quantity of attention from researchers round the world. To beat this downside variety of routing protocols are developed and also the number remains i...
Network Security Issues and Solutions
Network security is now days becoming more and more important because people like to connect with each other all the time via internet. Personal computer users, employees of professional organizations, government servant...
A Novel Method to Extract Comparison of Products Using Comparative Questions
Comparing one thing with another is a typical part of human decision making process, especially during an online purchase scheme. To assist decision making it is useful to compare entities that share common utility but h...
Cosine Similarity Function For The Temporal Dynamic Web Data
Cosine similarity function is one of the most popular similarity function for handling the web data in various applications such as recommender system, collaborative filtering algorithms, classification algorithms, etc....