(3) When we divide it by 5, we get remainder 1. Chinese Remainder Theorem states that there always exists an x that satisfies given congruences. Below is theorem statement adapted from wikipedia. Let num [0], num [1], …num [k-1] be positive integers that are pairwise coprime.
For More Information Please Refer: