Big Integer Calculator

1. Support Integer size [0 - 32768] bits (multiply product to 65536 bits).
2. Limit: (MAX: 5900 !)
3. some help.

3.1 ALL answers are saved to [Ans|GCD], besides these: (1) X/Y, when Remainder(X%Y) is saved to [Rem.]; (2) GCD(X,Y), when LCM(X,Y) is saved to [LCM]; (3) X^(1/n), When X is not a perfect power of n, the Remainder is saved to [Rem.];

3.2 (1) X^Y MOD Z (RSA en/decrypt, X=C, Y=E/D, Z=N) (2) A = Y/X MOD Z (or AX = Y (mod Z)) A = (Y (X^(-1) MOD Z)) MOD Z Using Extended Euclid's Method. In RSA pub-priv-key calc, e*d = 1 mod phi, LET x=e, y=1, z = phi, you can calc d.