Breaking News: Grepper is joining You.com. Read the official announcement!

prime check jaba

Shristi Gautam answered on September 3, 2021 Popularity 1/10 Helpfulness 8/10

answer prime check jaba

related prime check jaba

prime check jaba

Comment

 static boolean isPrime(int n){
        boolean result=true;
        if(n <= 1) return false;
        for(int i = 2; i <= n/2; i++){
            if(n % i == 0){
                result = false; //if some number divides it, then prime=false;
                break;
            }
        }
        return result;
    }

Popularity 1/10 Helpfulness 8/10 Language java

Source: Grepper

Tags: java

Link to this answer
Share Copy Link

Contributed on Sep 03 2021

Shristi Gautam

0 Answers Avg Quality 2/10

Closely Related Answers

prime check jaba

Comment

boolean isPrime(long n) {
    if(n < 2) return false;
    if(n == 2 || n == 3) return true;
    if(n%2 == 0 || n%3 == 0) return false;
    long sqrtN = (long)Math.sqrt(n)+1;
    for(long i = 6L; i <= sqrtN; i += 6) {
        if(n%(i-1) == 0 || n%(i+1) == 0) return false;
    }
    return true;
}

Popularity 1/10 Helpfulness 1/10 Language java

Source: w3programmers.org

Tags: java

Link to this answer
Share Copy Link