Searched refs:gcd (Results 1 - 7 of 7) sorted by relevance

/libcore/benchmarks/src/benchmarks/regression/
H A DBigIntegerBenchmark.java39 x.gcd(y);
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/
H A DBigIntegerModPowTest.java28 * 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
[all...]
H A DBigIntegerHashCodeTest.java45 aNumber1.gcd(aNumber2).pow(7);
H A DBigIntegerTest.java386 + mod, !one.equals(a.gcd(mod)));
407 + mod, !one.equals(a.gcd(mod)));
/libcore/luni/src/main/java/java/math/
H A DBigInteger.java885 public BigInteger gcd(BigInteger value) { method in class:BigInteger
886 return new BigInteger(BigInt.gcd(getBigInt(), value.getBigInt()));
H A DBigInt.java271 static BigInt gcd(BigInt a, BigInt b) { method in class:BigInt
H A DBigDecimal.java1197 BigInteger gcd; // greatest common divisor between 'p' and 'q'
1213 gcd = p.gcd(q);
1214 p = p.divide(gcd);
1215 q = q.divide(gcd);

Completed in 142 milliseconds