Finding Integer with Chinese Remainder Theorem

Click For Summary

Homework Help Overview

The discussion revolves around finding an integer between 1 and 1200 that satisfies specific modular conditions using the Chinese Remainder Theorem. The original poster presents a set of congruences and calculations that lead to a proposed solution.

Discussion Character

  • Exploratory, Assumption checking

Approaches and Questions Raised

  • Participants examine the correctness of the initial modular conditions, questioning whether the remainders should be (1, 2, 6) instead of (1, 10, 0). There is a focus on the application of the Chinese Remainder Theorem and the calculations derived from it.

Discussion Status

Some participants express confusion regarding the initial conditions and suggest a potential error in the remainders. There is acknowledgment of a mistake, with a consensus emerging that the correct remainders should indeed be (1, 2, 6).

Contextual Notes

The problem is framed within the constraints of a homework assignment, which may limit the information available for discussion. Participants are encouraged to explore the reasoning behind the modular conditions without providing direct solutions.

Math100
Messages
823
Reaction score
234
Homework Statement
A certain integer between ## 1 ## and ## 1200 ## leaves the remainders ## 1, 2, 6 ## when divided by ## 9, 11, 13 ##, respectively. What is the integer?
Relevant Equations
None.
Consider a certain integer between ## 1 ## and ## 1200 ##.
Then ## x\equiv 1\pmod {9}, x\equiv 10\pmod {11} ## and ## x\equiv 0\pmod {13} ##.
Applying the Chinese Remainder Theorem produces:
## n=9\cdot 11\cdot 13=1287 ##.
This means ## N_{1}=\frac{1287}{9}=143, N_{2}=\frac{1287}{11}=117 ## and ## N_{3}=\frac{1287}{13}=99 ##.
Observe that
\begin{align*}
&143x_{1}\equiv 1\pmod {9}\implies 8x_{1}\equiv 1\pmod {9}\implies x_{1}\equiv 8\pmod {9},\\
&117x_{2}\equiv 1\pmod {11}\implies -4x_{2}\equiv 1\pmod {11}\\
&\implies -12x_{2}\equiv 3\pmod {11}\implies -x_{2}\equiv 3\pmod {11}\implies x_{2}\equiv 8\pmod {11},\\
&99x_{3}\equiv 1\pmod {13}\implies -5x_{3}\equiv 1\pmod {13}\\
&-15x_{3}\equiv 3\pmod {13}\implies -2x_{3}\equiv 3\pmod {13}\\
&-12x_{3}\equiv 18\pmod {13}\implies x_{3}\equiv 5\pmod {13}.\\
\end{align*}
Now we have ## x_{1}=8, x_{2}=8 ## and ## x_{3}=5 ##.
Thus ## x\equiv (1\cdot 143\cdot 8+2\cdot 117\cdot 8+6\cdot 99\cdot 5)\pmod {1287}\equiv 5986\pmod {1287}\equiv 838\pmod {1287} ##.
Therefore, the integer is ## 838 ##.
 
Physics news on Phys.org
Everything is fine until ...

Math100 said:
Homework Statement:: A certain integer between ## 1 ## and ## 1200 ## leaves the remainders ## 1, 2, 6 ## when divided by ## 9, 11, 13 ##, respectively. What is the integer?
Relevant Equations:: None.

Consider a certain integer between ## 1 ## and ## 1200 ##.
Then ## x\equiv 1\pmod {9}, x\equiv 10\pmod {11} ## and ## x\equiv 0\pmod {13} ##.
... which I did not understand. Shouldn't it be ##(1,2,6)## instead of ##(1,10,0)?## Especially, because ...
Math100 said:
Applying the Chinese Remainder Theorem produces:
## n=9\cdot 11\cdot 13=1287 ##.
This means ## N_{1}=\frac{1287}{9}=143, N_{2}=\frac{1287}{11}=117 ## and ## N_{3}=\frac{1287}{13}=99 ##.
Observe that
\begin{align*}
&143x_{1}\equiv 1\pmod {9}\implies 8x_{1}\equiv 1\pmod {9}\implies x_{1}\equiv 8\pmod {9},\\
&117x_{2}\equiv 1\pmod {11}\implies -4x_{2}\equiv 1\pmod {11}\\
&\implies -12x_{2}\equiv 3\pmod {11}\implies -x_{2}\equiv 3\pmod {11}\implies x_{2}\equiv 8\pmod {11},\\
&99x_{3}\equiv 1\pmod {13}\implies -5x_{3}\equiv 1\pmod {13}\\
&-15x_{3}\equiv 3\pmod {13}\implies -2x_{3}\equiv 3\pmod {13}\\
&-12x_{3}\equiv 18\pmod {13}\implies x_{3}\equiv 5\pmod {13}.\\
\end{align*}
Now we have ## x_{1}=8, x_{2}=8 ## and ## x_{3}=5 ##.
Thus ## x\equiv (1\cdot 143\cdot 8+2\cdot 117\cdot 8+6\cdot 99\cdot 5)\pmod {1287}\equiv 5986\pmod {1287}\equiv 838\pmod {1287} ##.
Therefore, the integer is ## 838 ##.
... everything after that is correct again.
 
  • Like
Likes   Reactions: Math100
fresh_42 said:
Everything is fine until ...... which I did not understand. Shouldn't it be ##(1,2,6)## instead of ##(1,10,0)?## Especially, because ...

... everything after that is correct again.
Yes, I was wrong. It should definitely be (1, 2, 6).
 
  • Like
Likes   Reactions: fresh_42

Similar threads

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