|
|
 |
 |
 |
|
|
| Author Details |
Code Information |
|
|
|
Language
|
Java
|
|
Expires
|
Never
|
|
Length
|
603 Characters (30 Lines)
|
|
Password
|
no password
|
|
|
//What is the 10001st prime number? public class Problem7 { public static boolean isPrime(int nbr) { if (nbr == 1) return false; boolean isNPrime=true; for (int i = 2; i < nbr; i++) if ((nbr != i) && (nbr % i == 0)) { isNPrime = false; break; } if (isNPrime == true) return true; else return false; } public static void main(String[] args) { int counter = 0; int i = 2; while(counter < 10001) { if (isPrime(i)) counter++; i++; } i--; // i++ will itirate one extra time, so we subtract one System.out.println(i); } } |
|
| Please login to post comments. |
|
|
|
|
| |
 |
 |
| |
::
::
::
::
|
Version 1.44.00
Copyright © 2007 - 2008, Scott Thompson, All Rights Reserved
|
|
|
|
|