CODEWITHSUNDEEP
javanumbers
Sergio David Romero
Sergio David Romero

Reputation: 236

Prime numbers no loop no recursive

I have a doubt! It's the same always problem about the Prime numbers!! Is it possible to make it without using loops or recursive methods? Thanks a lot!! I have tried this (works for the first numbers!): 

public static boolean Prime(int number) {
    Scanner leer = new Scanner(System.in);
    int test1 = number % 2;
    int test2 = number % 3;
    int test3 = number % 5;
    if (number == 2 & test1 == 0 & test2 == 2) {
        return true;
    } else if (number == 3 & test1 == 1 & test2 == 0) {
        return true;
    } else if (number ==5 & test1==1 & test2== 2 & test3== 0){
        return true;
    } else if (test1 ==1 & test2 == 2 & test3 == 0){
        return false;
    } else if (test1 == 1 & test2 == 2) {
        return true;
    } else if (test1 == 1 & test2 == 1 & test3 == 0) {
        return false;
    } else if (test1 == 1 & test2 == 1) {
        return true;
    } else {
        return false;
    }
}

Upvotes: 1

Views: 676

Answers (1)

Pejman
Pejman

Reputation: 1358

No there is no way to perform primality test on an unlimited range of numbers without using any loop. Recursive solutions to this problem are also very limited in that they are not scalable.

Upvotes: 2

Related Questions