Isibali:
Engeza izinombolo ezimbili ezinkulu
Susa izinombolo ezimbili ezinkulu
Phindaphinda izinombolo ezimbili ezinkulu
Hlukanisa izinombolo ezimbili ezinkulu
Amandla enombolo enkulu
Umsuka wenombolo enkulu
I-Greatest Common Divisor (GCD) yezinombolo ezimbili ezinkulu
I-Lowest Common Multiple (LCM) yezinombolo ezimbili ezinkulu
Imojuli yezinombolo ezimbili ezinkulu
I-Module Inverse yezinombolo ezimbili ezinkulu
Amandla emojuli
Hlola ukuthi inombolo enkulu ibalulekile yini
I-phi-function ka-Euler
I-Factoral
Okulandelayo Okulandelayo kunombolo enkulu
Ipheya eyinhloko ephindwe kabili ukuya enambeni enkulu
Ama-algorithms:
Ifomu leQuadratic elilula. Xazulula okuthi x,y ukuthi bxy+dx+ey=f lapho b,d,e,f,x,y kokuthi Z.
I-Euclidean Algorithm. Bala i-Greatest Common Divisor (GCD) yezinombolo ezimbili u-a no-b.
I-Euclidean Algorithm Enwetshiwe. Xazulula okuthi x, y okuthi izembe + ngo = gcd(a, b).
I-Linear Diophantine Equation Eziguquguqukayo Ezimbili. Xazulula okuthi x,y kanjalo izembe+by=c.
I-Linear Congruence Ekuguquguqukeni Okukodwa. Xazulula ngokuthi x ukuhlangana kwefomu lembazo ≡ b (mod m).
I-Linear Congruence Eziguquguqukayo Ezimbili. Xazulula okuthi x,y, ukuhlangana kwefomu i-ax+ngo-≡ c (mod m).
I-Tonelli-Shanks Algorithm. Bala i-Quadratic Residue Modulo. Xazulula okuthi x, ukuhlangana kwefomu x² ≡ a (mod p) lapho u-p eyinhloko.
Ama-Mod Factors. Bala izinto ezingenzeka zemojuli yenombolo ethile kanye nemoduli. Thola n ≡ bc (mod a) lapho (izembe + c)(ay + b) = a(axy + bx + cy) + bc = n.
Uhlu lwamaPrimes. Uhlu lwama-primes ahlelwe ngamakholomu.
Qaphela: Ukusebenza kusekelwe kudivayisi.
Kubuyekezwe ngo-
Aga 14, 2025