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 Algorithm
for 5 and 3 → x = 2 and y = -1
for 5 and 3 → x = 2 and y = -1
What is the Answer?
Extended Euclidean Algorithm
for 5 and 3 → x = 2 and y = -1
for 5 and 3 → x = 2 and y = -1
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
