Find an integer having the remainders ## 2, 3, 4, 5 ##.

  • Thread starter Thread starter Math100
  • Start date Start date
  • Tags Tags
    Integer
AI Thread Summary
The integer that satisfies the conditions of having remainders 2, 3, 4, and 5 when divided by 3, 4, 5, and 6 respectively is 59. This is derived from the congruences which imply that x + 1 must be a multiple of the least common multiple of 3, 4, 5, and 6, which is 60. Consequently, x is congruent to -1 modulo 60, leading to the solution x = 59. The discussion also touches on the familiarity of the solution, with participants questioning if 59 has appeared in previous problems. The conclusion confirms that 59 is indeed the correct integer.
Math100
Messages
813
Reaction score
229
Homework Statement
Find an integer having the remainders ## 2, 3, 4, 5 ## when divided by ## 3, 4, 5, 6 ##, respectively. (Bhaskara, born ## 1114 ## ).
Relevant Equations
None.
Let ## x ## be an integer.
Then ## x\equiv 2\pmod {3}, x\equiv 3\pmod {4}, x\equiv 4\pmod {5} ## and ## x\equiv 5\pmod {6} ##.
This means
\begin{align*}
&x\equiv 2\pmod {3}\implies x+1\equiv 3\pmod {3}\implies x+1\equiv 0\pmod {3},\\
&x\equiv 3\pmod {4}\implies x+1\equiv 4\pmod {4}\implies x+1\equiv 0\pmod {4},\\
&x\equiv 4\pmod {5}\implies x+1\equiv 5\pmod {5}\implies x+1\equiv 0\pmod {5},\\
&x\equiv 5\pmod {6}\implies x+1\equiv 6\pmod {6}\implies x+1\equiv 0\pmod {6}.\\
\end{align*}
Observe that ## lcm(3, 4, 5, 6)=60 ##.
Thus ## x+1\equiv 0\pmod {60}\implies x\equiv -1\pmod {60}\implies x\equiv 59\pmod {60} ##.
Therefore, the integer is ## 59 ##.
 
Physics news on Phys.org
Correct. It looks somehow familiar. Have we had ##59## as a solution before?
 
fresh_42 said:
Correct. It looks somehow familiar. Have we had ##59## as a solution before?
I don't remember. It does not look familiar to me, though. Interesting to know that.
 
Back
Top