Emirp Program

Emirp Program:
Java Script Program:

class EmirpNumber {

    static prime(no) {
        let div = 2;

        while (div < no / 2) {
            if (no % div === 0) {
                return false;
            }
            div++;
        }

        return true;
    }

    static reverse(no) {
        let rev = 0;

        while (no > 0) {
            rev = rev * 10 + no % 10;
            no = Math.floor(no / 10);
        }

        return rev;
    }

    static main() {

        let num = 17;

        if (EmirpNumber.prime(num) && EmirpNumber.prime(EmirpNumber.reverse(num))) {
            console.log(num + " is emirp");
        } else {
            console.log(num + " is not emirp");
        }
    }
}

EmirpNumber.main();

Output:

Java Program:

class EmirpNumber {

    static boolean prime(int no) {
        int div = 2;

        while (div < no / 2) {
            if (no % div == 0) {
                return false;
            }
            div++;
        }

        return true;
    }

    static int reverse(int no) {
        int rev = 0;

        while (no > 0) {
            rev = rev * 10 + no % 10;
            no = no / 10;
        }

        return rev;
    }

    public static void main(String[] args) {

        int num = 17;

        if (prime(num) && prime(reverse(num))) {
            System.out.println(num + " is emirp");
        } else {
            System.out.println(num + " is not emirp");
        }
    }
}

Python Program:

def prime(no):
    div=2
    while div< no/2:
        if no%div==0:
            return False
        div+=1
    return True

def reverse(no):
    rev=0
    while no>0:
        rev=rev*10+no%10
        no=no//10
    return rev

num=17
if prime(num) and prime(reverse(num)):
    print(num,"is emirp")
else:
    print(num,"is not emirp")