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