Description:
To check whether a number is prime or not
Code:
package com.techonol.algos;
public class PrimeNumCheck {
public boolean isPrimeNumber(int number) {
for (int i = 2; i <= number / 2; i++) {
if (number % i == 0) {
return false;
}
}
return true;
}
public static void main(String a[]) {
PrimeNumCheck pc = new PrimeNumCheck();
System.out.println("Is 27 a prime number -->" + pc.isPrimeNumber(17));
System.out.println("Is 7 a prime number -->" + pc.isPrimeNumber(19));
System.out.println("Is 19 a prime number -->" + pc.isPrimeNumber(15));
}
}
Output:
Is 27 a prime number -->true Is 7 a prime number -->true Is 19 a prime number -->false