1322.14 – Chinese Remainders


Here's the story. NN is a positive integer. When NN is divided by 3, the quotient is QQ with remainder 1. When QQ is divided by 4, the quotient is RR with remainder 1. When RR is divided by 5, the quotient is SS with remainder 1. All three of the numbers, Q,R,S,Q, R, S, are positive integers.

Find the smallest possible value for NN that makes all this work.


Solution

All four of the numbers, NN, QQ, RR, and SS have a minimal property. NN is smallest such that when divided by 3 the quotient is QQ and remainder 1. QQ has a similar property: the divisor is 4 but the remainder is also 1. Ditto for RR except the divisor is 5 and the quotient is SS. When we come to SS there is no division requirement. Good deal! SS will be the easiest of all the numbers to discover. All that SS has to be is a positive integer. So we can let S=1S = 1, the smallest positive number period.

Now, all that RR has to do is have quotient SS with remainder 1. Start with S=1S = 1. Increasing by steps of 5, so as not to disturb the "when divided by 5" part, we reach 5+1=65 + 1 = 6, in one step and so arrive at the smallest number that when divided by 5 gives S=1S = 1 and has remainder 1. This is R=6R = 6.

To find QQ, we start again with 1, but add 4's this time until we reach a number which, when divided by 4, gives as quotient R=6R = 6 and still has remainder 1. This would be 1+4×6=251 + 4 \times 6 = 25. Thus Q=26Q = 26.

Finally, starting again with 1, we add 3's this time to reach a number that gives Q=25Q = 25 when divided by 3 with remainder 1. This would be N=1+3×25=76N = 1 + 3 \times 25 = 76. This is the smallest number satisfying all the requirements of the problem.

The answer is N=76N = 76.

Check:

  • 763=2513\dfrac{76}{3} = 25 \dfrac{1}{3}

  • 254=614\dfrac{25}{4} = 6 \dfrac{1}{4}

  • 65=115\dfrac{6}{5} = 1 \dfrac{1}{5}

If you're wondering what this has to do with China, this problem is an example of the Chinese Remainder Theorem, which can be explored on Google.