Enter a mod b statement
Answer
Success!
Extended Euclidean Algorithm
for 5 and 3 → x = 2 and y = -1
for 5 and 3 → x = 2 and y = -1
↓Steps Explained:↓
Solve the modulus equation
5x ≡ 8(mod 3)
Step 1: Calculate d = (5,3)
GCF (5,3) = 1
Step 2: We check to see if 1 | 8
| 8 = | 8 |
| 1 |
There will be 1 solutions mod 3
Build Diophantine equation from GCF
5x - 3y = 8
Final Answer
Extended Euclidean Algorithmfor 5 and 3 → x = 2 and y = -1
Take the Quiz
Related Calculators: Diophantine Equations | Chinese Remainder Theorem | Linear Congruential Generator