Solved

# How to find the Nth prime number

Posted on 2007-11-28
5,765 Views
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
Question by:toymachiner62
[X]
###### Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

• Help others & share knowledge
• Earn cash & points
• Learn & ask questions
• 2

LVL 6

Expert Comment

ID: 20371524
0

LVL 6

Expert Comment

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

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

Talmash earned 250 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

Question has a verified solution.

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

Computer science students often experience many of the same frustrations when going through their engineering courses. This article presents seven tips I found useful when completing a bachelors and masters degree in computing which I believe may he…
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 …
Starting up a Project
###### Suggested Courses
Course of the Month5 days, 17 hours left to enroll

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

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