Lines Matching refs:gcd
28 * Methods: modPow, modInverse, and gcd
240 * gcd: the second number is zero
250 BigInteger result = aNumber.gcd(bNumber);
260 * gcd: the first number is zero
270 BigInteger result = aNumber.gcd(bNumber);
280 * gcd: the first number is ZERO
288 BigInteger result = aNumber.gcd(bNumber);
298 * gcd: both numbers are zeros
304 BigInteger result = aNumber.gcd(bNumber);
313 * gcd: the first number is longer
323 BigInteger result = aNumber.gcd(bNumber);
333 * gcd: the second number is longer
343 BigInteger result = aNumber.gcd(bNumber);
