Finding Integer with Chinese Remainder Theorem

In summary: Sorry.In summary, the conversation discusses finding a certain integer between 1 and 1200 that leaves remainders of 1, 2, and 6 when divided by 9, 11, and 13, respectively. The Chinese Remainder Theorem is applied to find that the integer is 838. However, there is an error in the conversation as the remainders should be (1, 2, 6) instead of (1, 10, 0).
  • #1
Math100
783
220
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
  • #3
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 Math100
  • #4
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 fresh_42

FAQ: Finding Integer with Chinese Remainder Theorem

What is the Chinese Remainder Theorem?

The Chinese Remainder Theorem is a mathematical theorem that provides a method for finding a unique solution to a system of congruences. It states that if we have a set of pairwise relatively prime moduli, then there exists a unique solution to the system of congruences.

How does the Chinese Remainder Theorem work?

The Chinese Remainder Theorem works by finding the smallest positive integer that satisfies all of the congruences in the system. This integer is known as the solution to the system of congruences. The theorem uses modular arithmetic and the Chinese remainder theorem algorithm to find this solution.

What is the significance of the Chinese Remainder Theorem?

The Chinese Remainder Theorem has many applications in number theory, cryptography, and computer science. It can be used to solve problems involving modular arithmetic and to find solutions to systems of congruences. It also has applications in error-correcting codes and coding theory.

What are the limitations of the Chinese Remainder Theorem?

The Chinese Remainder Theorem can only be applied to systems of congruences where the moduli are pairwise relatively prime. If the moduli are not relatively prime, then the theorem cannot be used to find a unique solution. Additionally, the theorem only works for integers and cannot be applied to non-integer values.

How is the Chinese Remainder Theorem used in cryptography?

The Chinese Remainder Theorem is used in cryptography to encrypt and decrypt messages. It is used in the RSA algorithm, which is a popular public-key encryption method. The theorem is also used in the Chinese remainder theorem cryptosystem, which is a symmetric-key encryption method.

Back
Top