Programming Forums - View Single Post

victor_shade · Oct 27th, 2005, 4:21 PM

I need help writting code that returns primes in an array, one method that returns the nth prime number

int getNthPrimeNumber(int n ){

}

and a second that returns the number of prime numbers less than or equal to n

int getNumberPrimeNumbers(int n) {

}

thanks in advance for the help

Oct 27th, 2005, 4:21 PM	#1
victor_shade Newbie Join Date: Oct 2005 Posts: 3 Rep Power: 0	finding primes in an array I need help writting code that returns primes in an array, one method that returns the nth prime number int getNthPrimeNumber(int n ){ } and a second that returns the number of prime numbers less than or equal to n int getNumberPrimeNumbers(int n) { } thanks in advance for the help