Package com.google.common.math
Class BigIntegerMath
- java.lang.Object
-
- com.google.common.math.BigIntegerMath
-
@GwtCompatible(emulated=true) public final class BigIntegerMath extends java.lang.Object
A class for arithmetic on values of typeBigInteger.The implementations of many methods in this class are based on material from Henry S. Warren, Jr.'s Hacker's Delight, (Addison Wesley, 2002).
Similar functionality for
intand forlongcan be found inIntMathandLongMathrespectively.- Since:
- 11.0
-
-
Method Summary
All Methods Static Methods Concrete Methods Modifier and Type Method Description static java.math.BigIntegerbinomial(int n, int k)Returnsnchoosek, also known as the binomial coefficient ofnandk, that is,n! / (k! (n - k)!).static java.math.BigIntegerceilingPowerOfTwo(java.math.BigInteger x)Returns the smallest power of two greater than or equal tox.static java.math.BigIntegerdivide(java.math.BigInteger p, java.math.BigInteger q, java.math.RoundingMode mode)Returns the result of dividingpbyq, rounding using the specifiedRoundingMode.static java.math.BigIntegerfactorial(int n)Returnsn!, that is, the product of the firstnpositive integers, or1ifn == 0.static java.math.BigIntegerfloorPowerOfTwo(java.math.BigInteger x)Returns the largest power of two less than or equal tox.static booleanisPowerOfTwo(java.math.BigInteger x)Returnstrueifxrepresents a power of two.static intlog10(java.math.BigInteger x, java.math.RoundingMode mode)Returns the base-10 logarithm ofx, rounded according to the specified rounding mode.static intlog2(java.math.BigInteger x, java.math.RoundingMode mode)Returns the base-2 logarithm ofx, rounded according to the specified rounding mode.static java.math.BigIntegersqrt(java.math.BigInteger x, java.math.RoundingMode mode)Returns the square root ofx, rounded with the specified rounding mode.
-
-
-
Method Detail
-
ceilingPowerOfTwo
@Beta public static java.math.BigInteger ceilingPowerOfTwo(java.math.BigInteger x)
Returns the smallest power of two greater than or equal tox. This is equivalent toBigInteger.valueOf(2).pow(log2(x, CEILING)).- Throws:
java.lang.IllegalArgumentException- ifx <= 0- Since:
- 20.0
-
floorPowerOfTwo
@Beta public static java.math.BigInteger floorPowerOfTwo(java.math.BigInteger x)
Returns the largest power of two less than or equal tox. This is equivalent toBigInteger.valueOf(2).pow(log2(x, FLOOR)).- Throws:
java.lang.IllegalArgumentException- ifx <= 0- Since:
- 20.0
-
isPowerOfTwo
public static boolean isPowerOfTwo(java.math.BigInteger x)
Returnstrueifxrepresents a power of two.
-
log2
public static int log2(java.math.BigInteger x, java.math.RoundingMode mode)Returns the base-2 logarithm ofx, rounded according to the specified rounding mode.- Throws:
java.lang.IllegalArgumentException- ifx <= 0java.lang.ArithmeticException- ifmodeisRoundingMode.UNNECESSARYandxis not a power of two
-
log10
@GwtIncompatible public static int log10(java.math.BigInteger x, java.math.RoundingMode mode)
Returns the base-10 logarithm ofx, rounded according to the specified rounding mode.- Throws:
java.lang.IllegalArgumentException- ifx <= 0java.lang.ArithmeticException- ifmodeisRoundingMode.UNNECESSARYandxis not a power of ten
-
sqrt
@GwtIncompatible public static java.math.BigInteger sqrt(java.math.BigInteger x, java.math.RoundingMode mode)
Returns the square root ofx, rounded with the specified rounding mode.- Throws:
java.lang.IllegalArgumentException- ifx < 0java.lang.ArithmeticException- ifmodeisRoundingMode.UNNECESSARYandsqrt(x)is not an integer
-
divide
@GwtIncompatible public static java.math.BigInteger divide(java.math.BigInteger p, java.math.BigInteger q, java.math.RoundingMode mode)
Returns the result of dividingpbyq, rounding using the specifiedRoundingMode.- Throws:
java.lang.ArithmeticException- ifq == 0, or ifmode == UNNECESSARYandais not an integer multiple ofb
-
factorial
public static java.math.BigInteger factorial(int n)
Returnsn!, that is, the product of the firstnpositive integers, or1ifn == 0.Warning: the result takes O(n log n) space, so use cautiously.
This uses an efficient binary recursive algorithm to compute the factorial with balanced multiplies. It also removes all the 2s from the intermediate products (shifting them back in at the end).
- Throws:
java.lang.IllegalArgumentException- ifn < 0
-
binomial
public static java.math.BigInteger binomial(int n, int k)Returnsnchoosek, also known as the binomial coefficient ofnandk, that is,n! / (k! (n - k)!).Warning: the result can take as much as O(k log n) space.
- Throws:
java.lang.IllegalArgumentException- ifn < 0,k < 0, ork > n
-
-