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

/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/
H A DBigIntegerModPowTest.java28 * Methods: modPow, modInverse, and gcd
128 * modInverse: non-positive modulus
138 aNumber.modInverse(modulus);
145 * modInverse: non-invertible number
155 aNumber.modInverse(modulus);
162 * modInverse: positive number
172 BigInteger result = aNumber.modInverse(modulus);
182 * modInverse: positive number (another case: a < 0)
192 BigInteger result = aNumber.modInverse(modulus);
202 * modInverse
[all...]
H A DBigIntegerTest.java365 * @tests java.math.BigInteger#modInverse(java.math.BigInteger)
374 inv = a.modInverse(mod);
395 inv = a.modInverse(mod);
/libcore/luni/src/main/java/java/math/
H A DBigInteger.java968 public BigInteger modInverse(BigInteger m) { method in class:BigInteger
972 return new BigInteger(BigInt.modInverse(getBigInt(), m.getBigInt()));
980 * {@code pow(this.modInverse(modulus), -exponent) mod modulus} is computed.
996 BigInteger base = exponentSignum < 0 ? modInverse(modulus) : this;
H A DBigInt.java332 static BigInt modInverse(BigInt a, BigInt m) { method in class:BigInt

Completed in 150 milliseconds