Search:

My background is actually in IT, and in that field we don't really focus on programming. We are mostly responsible for implementing solutions. I want to learn programming to become more well...

Is it possible to reach in to the primes array and grab primes[max] to be able to print the "nth" prime number

Here is one using the Sieve of Eratosthenes. I found the algorithm on wikipedia.
I'm going to translate it to python


//Jeremiah A. Walker
//Prime number generator
//Java
//Sieve of...

good point. I actually wrote that program when I was first starting out in programming.

This is a program to generate all prime numbers between 0 and a given number(y). Is it possible to "translate" this program to java? The assignment calls on me to do this in java and I see no need...