fx-3650P/SC-185程式: 數論
1. 商及餘數(I) (Quotient and remainder I)
2. 商及餘數(II) (Quotient and remainder II)
3. 正整數冪餘數 (Remainder of positive integer power)
4. 孫子定理 (Chinese remainder Theorem)
5. 聯立同餘式(I) (simultaneous linear congruences I)
6. 聯立同餘 式(II) (simultaneous linear congruences II)
7. 質因子連乘積(I) (Prime factorization of positive integer I)
8. 質因子連乘積(II) (Prime factorization of positive integer II)
9. 質因子連乘積(III) (Prime factorization of positive integer III)
10. 質因子連乘積(IV) (Prime factorization of positive integer IV)
11. 最小公倍數及最大公因數應用內置分數功能) (H.C.F and L.C.M)
12. 最大公因數及最小公倍數 (H.C.F and L.C.M)
13. 費馬檢驗 (Fermat testing)
14. 米勒-拉賓檢驗 (Miller-Rabin Primality test)
15. C+nX被Y整除求最小n值 (Find minimum n if C+nX is divisible by Y)
如程式有任何錯誤或問題請聯絡 David Cheuk: kl_cheuk@yahoo.com.hk