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