First, note that
![93=3\times31](/tpl/images/0148/0446/c03f8.png)
, which gives
![70x\equiv3\pmod{93}\implies\begin{cases}70x\equiv3\equiv0\pmod3\\70x\equiv3\pmod{31}\end{cases}](/tpl/images/0148/0446/5b018.png)
so in fact we're dealing with the system
![\begin{cases}x\equiv17\pmod{23}\\70x\equiv0\pmod3\\70x\equiv3\pmod{31}\end{cases}](/tpl/images/0148/0446/035e4.png)
Now, 3, 23, and 31 are relatively prime, so we can use the Chinese remainder theorem. But before we do that, we need to rework and ultimately eliminate the coefficients of
![x](/tpl/images/0148/0446/a0e3f.png)
.
From the second equivalence, it follows immediately
![x](/tpl/images/0148/0446/a0e3f.png)
is some multiple of 3; this is because
![70x](/tpl/images/0148/0446/01024.png)
is divisible by 3, but 3 doesn't divide 70, so it must divide
![x](/tpl/images/0148/0446/a0e3f.png)
.
For the third equivalence, we can write
![70x=62x+8](/tpl/images/0148/0446/0223c.png)
. Then modulo 31, we have that
![62x\equiv0](/tpl/images/0148/0446/e8754.png)
, which leaves us with
![8x\equiv3\pmod{31}](/tpl/images/0148/0446/3eb89.png)
. We want a congruence of the form
![x\equiv\cdots](/tpl/images/0148/0446/9a49e.png)
, and to get that we can multiply
![8x](/tpl/images/0148/0446/7ff51.png)
and 3 by the inverse of 8 modulo 31.
To find this inverse, we solve for
![y](/tpl/images/0148/0446/9512c.png)
in the relation
![8y\equiv1\pmod{31}](/tpl/images/0148/0446/3848c.png)
by using the Euclidean algorithm, or making just making the observation that
![8\times4\equiv32\equiv1\pmod{31}](/tpl/images/0148/0446/d3d45.png)
, so
![8^{-1}\equiv4\pmod{31}](/tpl/images/0148/0446/a0976.png)
. Distributing 4 across the third equivalence in our system gives
![x\equiv4\pmod{31}](/tpl/images/0148/0446/940b0.png)
.
So to recap, we now have
![\begin{cases}x\equiv17\pmod{23}\\x\equiv0\pmod3\\x\equiv12\pmod{31}\end{cases}](/tpl/images/0148/0446/5c6c8.png)
and we're ready to use the CRT.
As a starting point, let's take
![x=(17)+(23)+(23)=63](/tpl/images/0148/0446/e8a0f.png)
It's clear that taken modulo 23, the latter two terms vanish and we have a remainder of 17, as desired. 63 is already a multiple of 3, but just to avoid doing more work later, let's multiply each term by 3 anyway to keep getting a remainder of 0:
![x=(17\times3)+(23\times3)+(23\times3)=146](/tpl/images/0148/0446/826c1.png)
Now multiply the first two terms by 31 to make sure they vanish when taken modulo 31. Meanwhile,
![23\times3\equiv69\equiv7\pmod{31}](/tpl/images/0148/0446/13dd7.png)
, but we want to get 12, so we would multiply this term by the inverse of 7 mod 31, and again by 12.
We can make a quick observation that
![7\times9=63=31\times2+1](/tpl/images/0148/0446/476b7.png)
, so
![7^{-1}\equiv9\pmod{31}](/tpl/images/0148/0446/da6d7.png)
. Alternatively, you can use the Euclidean algorithm to find this inverse. Either way, we get
![x=(17\times3\times31)+(23\times3\times31)+(23\times3\times9\times12)=11,172](/tpl/images/0148/0446/50dd3.png)
So we're told that
![x=11,172+(23\times3\times31)k=11,172+2139k](/tpl/images/0148/0446/4c1f8.png)
is our solution set, where
![k\in\mathbb Z](/tpl/images/0148/0446/26b06.png)
. We can "simplify" this slightly by finding the least positive residue modulo the product of our moduli, which would be
![11,172\equiv477\pmod{2139}](/tpl/images/0148/0446/bac62.png)
so we end up with
![x=477+2139k](/tpl/images/0148/0446/faff3.png)
for integers
![k](/tpl/images/0148/0446/cc0ac.png)
.