Explain in terms of integers and divisors the effect of the following Euclidlike
function:
public static boolean gcdlike(int p, int q)
{
if (q == 0) return (p == 1);
return gcdlike(q, p % q);
}