Accept a number and check is it prime number or not a prime number
Previous | Home | Next |
//Program for find Prime number
package r4r.co.in;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class NewClass1 {
public static void main(String[] args) throws IOException {
BufferedReader D1 = new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter the Number A:");
String s1 = D1.readLine();
int n1 = Integer.parseInt(s1);
//Code for Prime number
for (int i = 0; i <= n1; i++) {
if ((i % 2) == 0) { //Prime no. determine
System.out.println("Prime no of A:" + i);
}
}
}
}
Enter the Number A:
12
Prime no of A:0
Prime no of A:2
Prime no of A:4
Prime no of A:6
Prime no of A:8
Prime no of A:10
Prime no of A:12
Previous | Home | Next |