Explain in terms of integers and divisors the effect of the following Euclid-like function:
public static boolean gcdlike(int p, int q){ if (q == 0) return (p == 1); return gcdlike(q, p % q);}
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.