First convert it to an equivalent congruence using [$\ a\bmod n\, =\, b\bmod n\iff a\equiv b\pmod{\!n},\,$](https://math.stackexchange.com/a/614944/242) then solve the congruence equation as you would with normal arithmetic (using [Congruence Arithmetic Laws](https://math.stackexchange.com/a/879262/242)), i.e. rearrange to get $\,(c/d-c/f)\, b = e/f-a/d,\,$ then [use this](https://math.stackexchange.com/a/174687/2422) to solve that linear congruence for $\,b,\,$ i.e. compute a modular quotient (there may be zero, one, or many solutions in general).
– Bill DubuqueAug 17 '22 at 15:39