3x=9mod18
You asked:
Solve the linear congruence .
MathBot Answer:
There are multiple solutions for in the congruence relation :
Remove the greatest common factor shared between the left-hand side, the right-hand side, and the modulus. Dividing each by yields . From this, we know that has solutions.
This is a different expression in a different modulus, but can be used to compute the solutions.
We were originally solving . In mod , there are numbers that are solutions. Given that there is one unique solution in mod , the other solutions are equivalent in mod , but distinct in mod . These distinct solutions can be produced by adding the modulus to the result until the result is no longer less than , meaning the solutions to are .
These solutions can be verified by plugging them back into the original reduced equation :