Home » Java solved programs » Core java programs

Java program to check whether a given number is prime or composite (non-prime)

In this java program, we are going to check whether a given number is primer or composite (non-prime).
Submitted by Preeti Jain, on March 11, 2018

Given an integer number and we have to check whether it is prime or composite (non-prime) using java?

Check prime or composite (non-prime) in java

import java.util.Scanner;

class CheckNumberPrimeOrCompositeClass{
	public static void main(String[] args){
		//create Scanner class object for user input
		Scanner sc = new Scanner(System.in);

		// Display message for user understanding
		System.out.println("Enter any number");

		//Accept input from keyboard
		int input_num = sc.nextInt();
		// i variable initialize by 2 just 
		// because every number is divisible by 1
		int i=2;
		//Loop continues till input_num to 0
			// Entered number will be checked by i if we get 0 
			// then number is not prime then will check from next increment i

		if(input_num == i)
			System.out.println("Number is prime");
			System.out.println("Number is not prime");


D:\Java Articles>java CheckNumberPrimeOrCompositeClass
Enter any number
Number is prime

D:\Java Articles>java CheckNumberPrimeOrCompositeClass
Enter any number
Number is not prime

Was this page helpful? YES NO

Are you a blogger? Join our Blogging forum.

Comments and Discussions

© https://www.includehelp.com (2015-2018), Some rights reserved.

close Like other websites, this site uses cookies to deliver relevant ads based on your interest, by using our website, you acknowledge that you have read our privacy policy.