public static int gcd(int n1, int n2){
int gcd = 1;
int k = 2;
while(k <= m1 && k <= n2){
if(n1 % k == 0 && n2 % k == 0){
gcd = k;
}
k++;
}
return gcd;
}
public static int gcd(int n1, int n2){
int gcd = 1;
int k = 2;
while(k <= m1 && k <= n2){
if(n1 % k == 0 && n2 % k == 0){
gcd = k;
}
k++;
}
return gcd;
}