Lines Matching defs:gcd
229 // Filter out the gcd, d, so j/d and i/d are integer.
233 final long d = gcd(i, j);
243 final long d = gcd(i, j);
871 * using the "binary gcd" method which avoids division and modulo
878 * <code>gcd(Integer.MIN_VALUE, Integer.MIN_VALUE)</code>,
879 * <code>gcd(Integer.MIN_VALUE, 0)</code> and
880 * <code>gcd(0, Integer.MIN_VALUE)</code> throw an
883 * <li>The result of <code>gcd(x, x)</code>, <code>gcd(0, x)</code> and
884 * <code>gcd(x, 0)</code> is the absolute value of <code>x</code>, except
886 * <li>The invocation <code>gcd(0, 0)</code> is the only one which returns
897 public static int gcd(final int p, final int q) {
954 return -u * (1 << k); // gcd is u*2^k
960 * using the "binary gcd" method which avoids division and modulo
967 * <code>gcd(Long.MIN_VALUE, Long.MIN_VALUE)</code>,
968 * <code>gcd(Long.MIN_VALUE, 0L)</code> and
969 * <code>gcd(0L, Long.MIN_VALUE)</code> throw an
972 * <li>The result of <code>gcd(x, x)</code>, <code>gcd(0L, x)</code> and
973 * <code>gcd(x, 0L)</code> is the absolute value of <code>x</code>, except
975 * <li>The invocation <code>gcd(0L, 0L)</code> is the only one which returns
986 public static long gcd(final long p, final long q) {
1043 return -u * (1L << k); // gcd is u*2^k
1141 * using the formula <code>lcm(a,b) = (a / gcd(a,b)) * b</code>.
1165 int lcm = FastMath.abs(mulAndCheck(a / gcd(a, b), b));
1177 * using the formula <code>lcm(a,b) = (a / gcd(a,b)) * b</code>.
1200 long lcm = FastMath.abs(mulAndCheck(a / gcd(a, b), b));