A group of pirates with 17 members steal a bag of golden coins. When they share their loot evenly, it left with 3 coins. When they argue who should get the remaining of the coins, one of them is killed. Then the coins where shared again evenly. But now it left with 10 remaining coins. Another riot happened and one of them is killed again. This result in dividing the coins again and it turns out all of the pirates have the same amount of coins.
Determine the amount of gold coins in the bag!
Let $k$ be the number of gold coins. Then we have:
$$k \equiv 3 \pmod {17}$$ $$k \equiv 10 \pmod {16}$$
The format is simply $k \equiv \text{number of gold coins remaining} \pmod {\text{number of pirates}}$.
Can you now write the third congruence, and hence use the Chinese Remainder Theorem to find $k$?