Searched refs:gcd (Results 1 – 8 of 8) sorted by relevance
250 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()
45 aNumber1.gcd(aNumber2).pow(7); in testSameObject()
387 + mod, !one.equals(a.gcd(mod))); in test_modInverseLjava_math_BigInteger()408 + mod, !one.equals(a.gcd(mod))); in test_modInverseLjava_math_BigInteger()
37 x.gcd(y); in timeRandomGcd()
887 @NonNull public BigInteger gcd(@NonNull BigInteger value) { in gcd() method in BigInteger888 return new BigInteger(BigInt.gcd(getBigInt(), value.getBigInt())); in gcd()
1205 BigInteger gcd; // greatest common divisor between 'p' and 'q' in divide() local1221 gcd = p.gcd(q); in divide()1222 p = p.divide(gcd); in divide()1223 q = q.divide(gcd); in divide()
269 static BigInt gcd(BigInt a, BigInt b) { in gcd() method in BigInt
795 text/x-pcs-gcd gcd