In this tutorial how to create a program to check a number is prime or composite Core Java\u00a0 is shown.<\/p>\n
Code:<\/p>\n
PrimeNo.java<\/p>\n
class CheckPrime
\n{
\npublic static void main(String args[])
\n{
\nint number=Integer.parseInt(args[0]),i;
\nif(number==0)
\nSystem.out.println(number+” is whole number”);
\nelse if(number==1 || number==2)
\nSystem.out.println(number+” is prime number”);
\nelse
\n{
\nfor(i=2;i<number;i++)
\n{
\nif(number%i==0)
\n{
\nbreak;
\n}
\n}
\nif(i==number)
\nSystem.out.println(number+” is prime number”);
\nelse
\nSystem.out.println(number+” is composite number”);<\/p>\n
}
\n}
\n}<\/p>\n