The given congruence equations are
The first congruence can be converted to
(By division property
Now converting all the congruences from
by multiplying b with inverse of a under modulo n.
The obtained congruences are
Now using Chinese remainder theorem solution is obtained by
and are inverse of under modulo , so calculating .
Now substituting all the values in expression (*) .