NthPrime - { num++; div = 0; for (int i = 2; i...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
public class NthPrime { public static void main(String[] args) { System.out.print("Enter which prime number to calculate: "); int n = IO.readInt(); int count = 0; int num = 1; int div; while (count < n)
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: { num++; div = 0; for (int i = 2; i &lt;= Math.sqrt(num); i++) { if (num % i == 0) { div++; break; } } if (div == 0) { count++; } } IO.outputIntAnswer(num); } }...
View Full Document

This note was uploaded on 11/03/2009 for the course CS 01-111 taught by Professor Pradiphari during the Fall '09 term at Rutgers.

Ask a homework question - tutors are online