public class Loops{ public int gcd(int a, int b){ if (a > b){ int c = b; while ((a % c != 0) || (b % c != 0)){ c = c-1; } return c; } else { int c = a; while ((b % c != 0) || (a % c != 0)){ c = c-1; } return c; } } public int gcd2(int a, int b){ while (a != 0 ||b != 0){ int r = a % b; a = b; b = r; } if (a == 0){ return b; } else { return a; } } public boolean isPrime (int n){ int other = (int)Math.round(Math.sqrt(n)); while (other > 1){ if (gcd(n, other)>1){ other = other - 1; } else{ return true; } } return false; } }