Class BigIntegerMath
- java.lang.Object
-
- com.google.common.math.BigIntegerMath
-
@GwtCompatible(emulated=true) public final class BigIntegerMath extends 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
int
and forlong
can be found inIntMath
andLongMath
respectively.- Since:
- 11.0
- Author:
- Louis Wasserman
-
-
Method Summary
All Methods Static Methods Concrete Methods Modifier and Type Method Description static BigInteger
binomial(int n, int k)
Returnsn
choosek
, also known as the binomial coefficient ofn
andk
, that is,n! / (k! (n - k)!)
.static BigInteger
ceilingPowerOfTwo(BigInteger x)
Returns the smallest power of two greater than or equal tox
.static BigInteger
divide(BigInteger p, BigInteger q, RoundingMode mode)
Returns the result of dividingp
byq
, rounding using the specifiedRoundingMode
.static BigInteger
factorial(int n)
Returnsn!
, that is, the product of the firstn
positive integers, or1
ifn == 0
.static BigInteger
floorPowerOfTwo(BigInteger x)
Returns the largest power of two less than or equal tox
.static boolean
isPowerOfTwo(BigInteger x)
Returnstrue
ifx
represents a power of two.static int
log10(BigInteger x, RoundingMode mode)
Returns the base-10 logarithm ofx
, rounded according to the specified rounding mode.static int
log2(BigInteger x, RoundingMode mode)
Returns the base-2 logarithm ofx
, rounded according to the specified rounding mode.static double
roundToDouble(BigInteger x, RoundingMode mode)
Returnsx
, rounded to adouble
with the specified rounding mode.static BigInteger
sqrt(BigInteger x, RoundingMode mode)
Returns the square root ofx
, rounded with the specified rounding mode.
-
-
-
Method Detail
-
ceilingPowerOfTwo
public static BigInteger ceilingPowerOfTwo(BigInteger x)
Returns the smallest power of two greater than or equal tox
. This is equivalent toBigInteger.valueOf(2).pow(log2(x, CEILING))
.- Throws:
IllegalArgumentException
- ifx <= 0
- Since:
- 20.0
-
floorPowerOfTwo
public static BigInteger floorPowerOfTwo(BigInteger x)
Returns the largest power of two less than or equal tox
. This is equivalent toBigInteger.valueOf(2).pow(log2(x, FLOOR))
.- Throws:
IllegalArgumentException
- ifx <= 0
- Since:
- 20.0
-
isPowerOfTwo
public static boolean isPowerOfTwo(BigInteger x)
Returnstrue
ifx
represents a power of two.
-
log2
public static int log2(BigInteger x, RoundingMode mode)
Returns the base-2 logarithm ofx
, rounded according to the specified rounding mode.- Throws:
IllegalArgumentException
- ifx <= 0
ArithmeticException
- ifmode
isRoundingMode.UNNECESSARY
andx
is not a power of two
-
log10
@GwtIncompatible public static int log10(BigInteger x, RoundingMode mode)
Returns the base-10 logarithm ofx
, rounded according to the specified rounding mode.- Throws:
IllegalArgumentException
- ifx <= 0
ArithmeticException
- ifmode
isRoundingMode.UNNECESSARY
andx
is not a power of ten
-
sqrt
@GwtIncompatible public static BigInteger sqrt(BigInteger x, RoundingMode mode)
Returns the square root ofx
, rounded with the specified rounding mode.- Throws:
IllegalArgumentException
- ifx < 0
ArithmeticException
- ifmode
isRoundingMode.UNNECESSARY
andsqrt(x)
is not an integer
-
roundToDouble
@GwtIncompatible public static double roundToDouble(BigInteger x, RoundingMode mode)
Returnsx
, rounded to adouble
with the specified rounding mode. Ifx
is precisely representable as adouble
, itsdouble
value will be returned; otherwise, the rounding will choose between the two nearest representable values withmode
.For the case of
RoundingMode.HALF_DOWN
,HALF_UP
, andHALF_EVEN
, infinitedouble
values are considered infinitely far away. For example, 2^2000 is not representable as a double, butroundToDouble(BigInteger.valueOf(2).pow(2000), HALF_UP)
will returnDouble.MAX_VALUE
, notDouble.POSITIVE_INFINITY
.For the case of
RoundingMode.HALF_EVEN
, this implementation uses the IEEE 754 default rounding mode: if the two nearest representable values are equally near, the one with the least significant bit zero is chosen. (In such cases, both of the nearest representable values are even integers; this method returns the one that is a multiple of a greater power of two.)- Throws:
ArithmeticException
- ifmode
isRoundingMode.UNNECESSARY
andx
is not precisely representable as adouble
- Since:
- 30.0
-
divide
@GwtIncompatible public static BigInteger divide(BigInteger p, BigInteger q, RoundingMode mode)
Returns the result of dividingp
byq
, rounding using the specifiedRoundingMode
.- Throws:
ArithmeticException
- ifq == 0
, or ifmode == UNNECESSARY
anda
is not an integer multiple ofb
-
factorial
public static BigInteger factorial(int n)
Returnsn!
, that is, the product of the firstn
positive integers, or1
ifn == 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:
IllegalArgumentException
- ifn < 0
-
binomial
public static BigInteger binomial(int n, int k)
Returnsn
choosek
, also known as the binomial coefficient ofn
andk
, that is,n! / (k! (n - k)!)
.Warning: the result can take as much as O(k log n) space.
- Throws:
IllegalArgumentException
- ifn < 0
,k < 0
, ork > n
-
-