Java prime number program
A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is called a composite number.
Java prime number program is given bellow:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 |
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.List; public class PrimeNumber { public static void main(String[] args) throws IOException { System.out.println("Series of Numbers Prime number calculation:"); int a; BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); System.out.println("Please enter the Series last number"); a = Integer.parseInt(br.readLine()); System.out.println("You entered :" + a); int primeNumberFlag = 0; List primeList = new ArrayList(); List notPrimeList = new ArrayList(); System.out.println("Series of nuumbers is "); for (int i = 2; i <= a; i++) { for (int j = 2; j <= i; j++) { if ((i != j) && (i % j == 0)) { primeNumberFlag = 1; break; } else { primeNumberFlag = 0; } } if (i != 2 && primeNumberFlag == 1) { notPrimeList.add(i); } else { primeList.add(i); } System.out.print(i + " "); } System.out.println(""); System.out.println("Prime Number List from number 1 to " + a); for (Integer primeL : primeList) { System.out.print(primeL + " "); } System.out.println(""); System.out.println("Not Prime Number List from number 1 to " + a); for (Integer notPrimeL : notPrimeList) { System.out.print(notPrimeL + " "); } // If you want to test only a number is prime or not , you may use this code given bellow /* for (int i = 2; i <= a; i++) { if (i == a) { System.out.println(a + " is prime number"); } else { if (a % i == 0) { System.out.println(a + " is not prime"); break; } } } */ } } |