Find the lowest number that has a remainder of
1 when divided by 2,
2 when divided by 3,
3 when divided by 4,
4 when divided by 5, and
5 when divided by 6.
It is possible to solve this by applying the general algorithm that solves Chinese Remainder problems. But, for this special...