Go Premium for a chance to win a PS4. Enter to Win

x
?
Solved

How to find the Nth prime number

Posted on 2007-11-28
4
Medium Priority
?
5,887 Views
Last Modified: 2010-10-05
I need to find the Nth prime number. I.E. if the input is 3 it should return 5 because the first three prime numbers are 2,3, and 5. 4 should return 7 and so on. I just need an algorithm or some pseudocode here right now because i'm writing this in assembler. So far this is what i have.

for(divisor = 2; divisor < num; divis++)
{
     if((num mod divisor) == 0)
          num is not prime
          break out of the loop
}
if((num - divisor) == 1)
     num is a prime
//if num - divisor == 1 that means that it made it the whole way through the for loop without being broken out of the loop and there was no number that would divide the number therefore it is prime.


     
0
Comment
Question by:toymachiner62
  • 2
4 Comments
 
LVL 6

Expert Comment

by:Hardi
ID: 20371548
There is a site for calculating the n-th prime, and it explains a bit of the algorithm you may be interested
http://primes.utm.edu/nthprime/algorithm.php
0
 
LVL 29

Expert Comment

by:pepr
ID: 20371817
I would recommend to have a look at wikipedia "Prime number" (http://en.wikipedia.org/wiki/Prime_number).  You will find there some theory and also a lot of references.

See the section "5.1 Finding prime numbers" (http://en.wikipedia.org/wiki/Prime_number#Finding_prime_numbers). The very first references in the section point to the "easy, brute force" and "fast" algorithms:

Sieve of Eratosthenes (http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes)
Sieve of Atkin (http://en.wikipedia.org/wiki/Sieve_of_Atkin -- contains reference to implementation in Python and in C)
0
 
LVL 6

Accepted Solution

by:
Talmash earned 750 total points
ID: 20372965
beyond the info on web:

find = 4 // find first 4 primes
found=1 // still only "2" found
print "2\n"
num = 3 // check if num is a prime

while (found < find) {
  for(divisor = 2; divisor < num; divis++) {
     if((num mod divisor) == 0) {
          num is not prime
          break out of the "for" loop
     }
   
    if(divisor*divisor > num) {
    //if((num - divisor) == 1)
     num is a prime
     print num
     found++
     break out of the "for" loop
    }
  } // close "for"
} // close while

this code is closer to what you need.

tal
0

Featured Post

[Webinar] Cloud and Mobile-First Strategy

Maybe you’ve fully adopted the cloud since the beginning. Or maybe you started with on-prem resources but are pursuing a “cloud and mobile first” strategy. Getting to that end state has its challenges. Discover how to build out a 100% cloud and mobile IT strategy in this webinar.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Today, the web development industry is booming, and many people consider it to be their vocation. The question you may be asking yourself is – how do I become a web developer?
Q&A with Course Creator, Mark Lassoff, on the importance of HTML5 in the career of a modern-day developer.
An introduction to basic programming syntax in Java by creating a simple program. Viewers can follow the tutorial as they create their first class in Java. Definitions and explanations about each element are given to help prepare viewers for future …
Loops Section Overview

916 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question