gcd lcm
October 24th, 2009
public static int gcd(int a, int b)
{
if(b == 0) return a;
return gcd(b, a%b);
}
public static int lcm(int a, int b)
{
return Math.abs(a*b)/gcd(a,b);
}
public static int gcd(int a, int b)
{
if(b == 0) return a;
return gcd(b, a%b);
}
public static int lcm(int a, int b)
{
return Math.abs(a*b)/gcd(a,b);
}
public static boolean isPowerOfTwo(int x)
{
return ((x & (x-1)) == 0);
}
public static Vector<Integer> primeFactorize(int x)
{
Vector<Integer> factors = new Vector<Integer>();
for(int i = 2; i <= Math.sqrt(x); i++)
{
while(x%i == 0)
{
factors.add(i);
x /= i;
}
}
if(x > 1)
factors.add(x);
return factors;
}