-
-
[原创][版本更新] 大整数计算器Big Integer Calculator v1.12，庆祝2008元旦
-
发表于: 2007-7-13 02:15
-
Big Integer Calculator v1.12
庆祝2008元旦，更新版本。
说明:
因为计算n!采用的从n*(n-1)*...*1,初始化为n,--自乘到1。
0!不接着计算，显示为0。小失误，应该是1。
按数学定义0! = 1，0的阶乘没有乘法意义，就是人为约定为1。
比如搞笑的四个0凑24，
（0! + 0! + 0! + 0!）! = 24
对0!不在意的，不用下载了，只是判断了0!显示为1而已。
BigIntCalc112_0!_fix.rar
[About]
Freeware.
[Help]
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)
A*X=Y MOD Z, when B = (AX-Y)/Z is saved to ;
(4)
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)
AX = Y MOD Z (or A*X = Y + B*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.
[ChangeLog]
v1.12 build 2007-12-01
* fix a bug
v1.12 2007-08-25
* fix an init b64 bug in v1.10
* fix Prime(X) dead loop when x=1
* minor interface change
+ add power_add function
v1.10f 2007-08-17
+ update bits status
* Use base change code from BaseAnyKit
v1.10 2007-08-17
+ Larger buffer size, bigger bits
Add some new fuctions.
+ Multi-Multiply
+ Multiply-Add
+ Multi-PowMod
+ Prime(X)
+ Clear
+ Copy Answer to X
+ Improve interface
v1.05 2007-07-14
* fix base64 bug
+ updated bits status info
v1.02 2007-07-13
* fix X^ (1/n) bug；
* fix AX = Y MOD Z bug in some condition judgement
+ add invalid digit input check
庆祝2008元旦，更新版本。
说明:
因为计算n!采用的从n*(n-1)*...*1,初始化为n,--自乘到1。
0!不接着计算，显示为0。小失误，应该是1。
按数学定义0! = 1，0的阶乘没有乘法意义，就是人为约定为1。
比如搞笑的四个0凑24，
（0! + 0! + 0! + 0!）! = 24
对0!不在意的，不用下载了，只是判断了0!显示为1而已。
BigIntCalc112_0!_fix.rar
[About]
Freeware.
[Help]
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)
A*X=Y MOD Z, when B = (AX-Y)/Z is saved to ;
(4)
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)
AX = Y MOD Z (or A*X = Y + B*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.
[ChangeLog]
v1.12 build 2007-12-01
* fix a bug
v1.12 2007-08-25
* fix an init b64 bug in v1.10
* fix Prime(X) dead loop when x=1
* minor interface change
+ add power_add function
v1.10f 2007-08-17
+ update bits status
* Use base change code from BaseAnyKit
v1.10 2007-08-17
+ Larger buffer size, bigger bits
Add some new fuctions.
+ Multi-Multiply
+ Multiply-Add
+ Multi-PowMod
+ Prime(X)
+ Clear
+ Copy Answer to X
+ Improve interface
v1.05 2007-07-14
* fix base64 bug
+ updated bits status info
v1.02 2007-07-13
* fix X^ (1/n) bug；
* fix AX = Y MOD Z bug in some condition judgement
+ add invalid digit input check
[注意]传递专业知识、拓宽行业人脉——看雪讲师团队等你加入！
|
|
|---|---|
|
|
支持下
|
|
|
|
|
|
|
|
|
|
|
|
不错!支持一下!
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
竟然被我发现了这么好的东东,不下对不起自己啊!
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
支持原创实用工具。
|
|
|
|
|
|
新的工具，即将完成。
还有部分功能正在coding中。 有功能需求的请尽快提出。 界面预览： RDLP - RSA,Rabin Keygenerator and DLP Tool  |
|
|
|
|
|
|
