lcm, least common multipler, gcd, greatest common divisor
int lcm(int a, int b) { return a * (b / gcd(a, b)); // write a*b/gcd(a,b) may overflow } int gcd(int a, int b) { if(b == 0) return a; return gcd(b, a%b); }