Home
last modified time | relevance | path

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

/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/
DBigIntegerModPowTest.java250 BigInteger result = aNumber.gcd(bNumber); in testGcdSecondZero()
270 BigInteger result = aNumber.gcd(bNumber); in testGcdFirstZero()
288 BigInteger result = aNumber.gcd(bNumber); in testGcdFirstZERO()
304 BigInteger result = aNumber.gcd(bNumber); in testGcdBothZeros()
323 BigInteger result = aNumber.gcd(bNumber); in testGcdFirstLonger()
343 BigInteger result = aNumber.gcd(bNumber); in testGcdSecondLonger()
DBigIntegerHashCodeTest.java45 aNumber1.gcd(aNumber2).pow(7); in testSameObject()
DBigIntegerTest.java386 + mod, !one.equals(a.gcd(mod))); in test_modInverseLjava_math_BigInteger()
407 + mod, !one.equals(a.gcd(mod))); in test_modInverseLjava_math_BigInteger()
/libcore/benchmarks/src/benchmarks/regression/
DBigIntegerBenchmark.java39 x.gcd(y); in timeRandomGcd()
/libcore/luni/src/main/java/java/math/
DBigInteger.java885 public BigInteger gcd(BigInteger value) { in gcd() method in BigInteger
886 return new BigInteger(BigInt.gcd(getBigInt(), value.getBigInt())); in gcd()
DBigDecimal.java1197 BigInteger gcd; // greatest common divisor between 'p' and 'q' in divide() local
1213 gcd = p.gcd(q); in divide()
1214 p = p.divide(gcd); in divide()
1215 q = q.divide(gcd); in divide()
DBigInt.java271 static BigInt gcd(BigInt a, BigInt b) { in gcd() method in BigInt