3x=9mod18

asked by guest
on Mar 28, 2025 at 2:22 am



You asked:

Solve the linear congruence 3x9(mod18)3 x \equiv 9 \pmod{18}.

MathBot Answer:

There are multiple solutions for xx in the congruence relation 3x9(mod18)3 x \equiv 9 \pmod{18}: x{3,9,15}\textcolor{#228B22}{x \in \left\{ 3, 9, 15\right\} }


Remove the greatest common factor shared between the left-hand side, the right-hand side, and the modulus. Dividing each by 33 yields x3(mod6)x \equiv 3 \pmod{6}. From this, we know that 3x9(mod18)3 x \equiv 9 \pmod{18} has 33 solutions.

This is a different expression in a different modulus, but can be used to compute the solutions.



We were originally solving 3x9(mod18)3 x \equiv 9 \pmod{18}. In mod 1818, there are 33 numbers that are solutions. Given that there is one unique solution in mod 66, the other solutions are equivalent in mod 66, but distinct in mod 1818. These distinct solutions can be produced by adding the modulus 66 to the result until the result is no longer less than 1818, meaning the solutions to 3x9(mod18)3 x \equiv 9 \pmod{18} are 3,9,153, 9, 15.

These solutions can be verified by plugging them back into the original reduced equation 3x9(mod18)3 x \equiv 9 \pmod{18}: 33=  9  9(mod18)39=  27  9(mod18)315=  45  9(mod18)\begin{align*} & 3 \cdot 3 & = \; & 9 & \equiv \; & 9 \pmod{ 18 } \\ & 3 \cdot 9 & = \; & 27 & \equiv \; & 9 \pmod{ 18 } \\ & 3 \cdot 15 & = \; & 45 & \equiv \; & 9 \pmod{ 18 } \\ \end{align*}