Java - Check if a number is prime number

Description

Check if a number is prime number

Demo

public class Main {

  static boolean isPrime(int number) {
    for (int i = 2; i <= Math.sqrt(number); i++) {
      if (number % i == 0) {
        return false;
      }/*from   w ww. j a  v  a 2  s  . co  m*/
    }
    return true;
  }

  public static void main(String[] args) {
    int number = 89;
    if (number >= 2 && isPrime(number)) {
      System.out.println("Prime");
    } else {
      System.out.println("Not prime");
    }
  }
}

Related Topic

• if Statement
• Nested if statement
• if statement vs ternary operator
• Grading System
• determines if input number is prime
• Use if else statement to output day of week
• Valid Triangle
• Sort three numbers
• print all numbers from 1-1000 that are divisible by both 3 and 5
• Use loops to do simple math
• Use conditional statements
• Age range with if statement
• Find Duplicate in an int value array with nested for loop
• Get the Smallest Of 3 Numbers
• User chooses a number then checks if it matches the random number and loops again if you lose and stops until you win
• checks how much time has passed by via Scanner

• Previous
• Next