Home
last modified time | relevance | path

Searched refs:modInverse (Results 1 – 4 of 4) sorted by relevance

/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/
DBigIntegerModPowTest.java138 aNumber.modInverse(modulus); in testmodInverseException()
155 aNumber.modInverse(modulus); in testmodInverseNonInvertible()
172 BigInteger result = aNumber.modInverse(modulus); in testmodInversePos1()
192 BigInteger result = aNumber.modInverse(modulus); in testmodInversePos2()
212 BigInteger result = aNumber.modInverse(modulus); in testmodInverseNeg1()
230 BigInteger result = aNumber.modInverse(modulus); in testmodInverseNeg2()
DBigIntegerTest.java374 inv = a.modInverse(mod); in test_modInverseLjava_math_BigInteger()
395 inv = a.modInverse(mod); in test_modInverseLjava_math_BigInteger()
/libcore/luni/src/main/java/java/math/
DBigInteger.java968 public BigInteger modInverse(BigInteger m) { in modInverse() method in BigInteger
972 return new BigInteger(BigInt.modInverse(getBigInt(), m.getBigInt())); in modInverse()
996 BigInteger base = exponentSignum < 0 ? modInverse(modulus) : this; in modPow()
DBigInt.java328 static BigInt modInverse(BigInt a, BigInt m) { in modInverse() method in BigInt