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

  • Thread starter Thread starter Math100
  • Start date Start date
  • Tags Tags
    Integer
Click For Summary
SUMMARY

The integer that satisfies the conditions of having remainders 2, 3, 4, 5 when divided by 3, 4, 5, and 6 respectively is 59. This conclusion is derived from the system of congruences: x ≡ 2 (mod 3), x ≡ 3 (mod 4), x ≡ 4 (mod 5), and x ≡ 5 (mod 6). By transforming these congruences, it is established that x + 1 must be a multiple of the least common multiple (LCM) of 3, 4, 5, and 6, which is 60. Thus, x ≡ -1 (mod 60) leads to the definitive solution of x ≡ 59 (mod 60).

PREREQUISITES
  • Understanding of modular arithmetic and congruences
  • Knowledge of least common multiples (LCM)
  • Familiarity with integer solutions to systems of equations
  • Basic algebraic manipulation skills
NEXT STEPS
  • Study the Chinese Remainder Theorem for solving systems of congruences
  • Learn about modular inverses and their applications
  • Explore advanced topics in number theory, such as Diophantine equations
  • Investigate practical applications of modular arithmetic in cryptography
USEFUL FOR

Mathematicians, students studying number theory, educators teaching modular arithmetic, and anyone interested in solving integer equations.

Math100
Messages
817
Reaction score
230
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.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K