Java Large number Bininteger

When we meet long does not need to consider this bininteger, because this is as long as you have enough memory, you can enter a large number, with this processing of high-precision problems, it is very easy, for me this just learn Java new, long insight, really more convenient than C

BigInteger arbitrarily large integers, in principle, as long as your computer's memory is large enough to have unlimited digits

Force type conversion int---BigInteger

Biginteger.valueof (k);

VALUEOF: Assigning an initial value

add:+ A.add (b);

subtract:-

multiply:*

divide:/

Remainder:this% val

Divideandremainder:a[0]=this/val; A[1]=this% val

Pow:a.pow (b) =a^b

Gcd,abs: Number of conventions, absolute value

Negate: Take negative numbers

Signum: Symbolic functions

Mod:a.mod (b) =a%b;

ABS ()//returns the BigInteger whose value is the absolute of this biginteger.
Add (BigInteger val)//returns the BigInteger whose value is (This+val).
Subtract (BigInteger val)//returns the BigInteger whose value is (This-val).
Multiply (BigInteger val)//returns the BigInteger whose value is (This*val).
Divide (BigInteger val)//returns the BigInteger whose value is (This/val).
Remainder (BigInteger val)//returns the BigInteger whose value is (This%val).
CompareTo (BigInteger val)//compares this BigInteger with the specified BigInteger. The return value of 1, 0,-1 represents greater than, equal to, or less than
POW (int exponent)//returns the exponent power of the current large number.
ToString ()//returns the decimal string representation of this BigInteger.
toString (int radix)//Returns a string representation of the given cardinality (radix) of this BigInteger.

Resource reference: https://www.cnblogs.com/jin-nuo/p/5313205.html

Java Large number Bininteger