prime check java
static boolean isPrime(int n){
boolean result=true;
if(n <= 1) return false;
for(int i = 2; i <= n/2; i++){ //n/2 because the largest factor of any number is either it's half or less than it
if(n % i == 0){
result = false; //if some number divides it, then prime=false;
break;
}
}
return result;
}prime in java
public class Prime {
public static void main(String[] args) {
int num = 29;
boolean flag = false;
for(int i = 2; i <= num/2; ++i){
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.");
}}
Source:www.prograjava prime
public class Prime {
public static boolean isPrime(int num) {
if (num<2)
return false;
for(int i=3;i<=Math.sqrt(num);i+=2)
if(num%i==0)
return false ;
return true ;
}
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
