Cacher is the code snippet organizer for pro developers

int leastCommonPrimeDivisor(int a, int b) {
    for (int i = 2; i <= Math.max(a, b); i++) {
        if (a % i == 0 && b % i == 0 && p(i)) {
            return i;
        }
    }
    return -1;
}

boolean p(int a) {
    for (int i = 2; i < a; i++) {
        if (a % i == 0) return false;
    }
    return true;
}