write a program to print the no is composite or prime in Java language
Answers
Explanation:
TUTORIALS
EXAMPLES
search
Java Program to Check Whether a Number is Prime or Not
In this article, you'll learn to check whether a number is prime or not. This is done using a for loop and while loop in Java.
A prime number is a number which is divisible by only two numbers: 1 and itself. So, if any number is divisible by any other number, it is not a prime number.
Example 1: Program to Check Prime Number using a for loop
public class Prime {
public static void main(String[] args) {
int num = 29;
boolean flag = false;
for(int i = 2; i <= num/2; ++i)
{
// condition for nonprime number
if(num % i == 0)
{
flag = true;
break;
}
}
if (!flag)
System.out.println(num + " is a prime number.");
else
System.out.println(num + " is not a prime number.");
}
}
When you run the program, the output will be:
29 is a prime number.
Answer:
A program to print the number is composite or prime in J
java programming language.
Explanation:
public class Prime {
public static void main(String[] args) {
int num = 29;
boolean flag = false;
for(int i = 2; i <= num/2; ++i)
{
// condition for nonprime number
if(num % i == 0)
{
flag = true;
break;
}
}
if (!flag)
System.out.println(num + " is a prime number.");
else
System.out.println(num + " is not a prime number.");
}
}
Output:-
Enter number:-
11 is a prime number