Simple program written in Java to check if number is a prime number.

import java.util.Scanner;

// © 2017 TheFlyingKeyboard
// theflyingkeyboard.net

public class CheckIfPrime {
  public static void main(String []args) {
      Scanner reader = new Scanner(System.in);
      int n; 	
      boolean isPrime = true;
      
      System.out.println("Enter a number: ");
      n = reader.nextInt(); //Reads integer from keyboard
      
      for(int i = 2; i < n / 2; i++){
        if(n % i == 0){	//Checks if number can be divided without remainder
          isPrime = false;
          
          System.out.println("Number is not prime!");
          break;
        }
      }
      
      if(isPrime){
        System.out.println("Number is prime!");
      }
      
      reader.close();
     }
}

 



Java Check If Number Is Prime
Tagged on:     

Leave a Reply

Your email address will not be published. Required fields are marked *

By continuing to use the site, you agree to the use of cookies. You can read more about it the Cookies&Privacy Policy Section Above. more information

The cookie settings on this website are set to "allow cookies" to give you the best browsing experience possible. If you continue to use this website without changing your cookie settings or you click "Accept" below then you are consenting to this. You can read more about it the Cookies&Privacy Policy Section.

Close