Solving $151x − 294 \equiv 44 \pmod{7}$

modular arithmetic

I've solved normal congruence equations like $ax \equiv b \pmod{m}$ but now I am trying to solve $ 1 5 1 x − 294 \equiv44\pmod{7}$. How do I solve this one? Can I just add $294$ to both sides and solve as normal using Euclidean algorithm?

I read the answer by quanta in this question but it is still not clear to me.

Can anyone please elaborate more on this?

Thanks for any help.

Best Answer

We have that

$$151x − 294 \equiv 44 \pmod{7} \iff 4x-0\equiv 2 \pmod{7} \iff 2x\equiv 1 \pmod{7}$$

and by Euclidean algorithm we can find

$$4\cdot 2-1\cdot 7=1$$

therefore $4$ is the inverse of $2 \pmod 7$ and we find

$$4\cdot 2x\equiv 4\cdot 1 \pmod{7} \implies x\equiv 4 \pmod{7}$$