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 Algorithm
for 2 and 17 → x = 1 and y = -8
for 2 and 17 → x = 1 and y = -8
What is the Answer?
Extended Euclidean Algorithm
for 2 and 17 → x = 1 and y = -8
for 2 and 17 → x = 1 and y = -8
How does the Linear Congruence Calculator work?
Free Linear Congruence Calculator - Given an modular equation ax ≡ b (mod m), this solves for x if a solution exists
This calculator has 3 inputs.
This calculator has 3 inputs.
What 2 formulas are used for the Linear Congruence Calculator?
ax ≡ b (mod m)
ax + by = c
ax + by = c
What 4 concepts are covered in the Linear Congruence Calculator?
- congruence
- a problem of finding an integer x that satisfies the equation ax = b (mod m)
- equation
- a statement declaring two mathematical expressions are equal
- linear congruence
- a problem of finding an integer x that satisfies the equation ax = b (mod m)
- modulus
- the remainder of a division, after one number is divided by another.
a mod b
