Linear Congruence Equation
Suppose we have
(A X) % m = b (here % stands for modulo operation)
In this, we have to find the value of X which satisfies the equation
Note : A solution will exist only if -> B is divisible by GCD(A,m)
Example :
(7 x) % 11 = 4
In this put x = 10
Linear Congruence Equation Suppose we have (A X) % m = b (here % stands for modulo operation) In this, we have to find the value of X which satisfies the equation Note : A solution will exist only if -> B is divisible by GCD(A,m) Example : (7 x) % 11 = 4 In this put x = 10