 |
| ||
| |||
|
| Math Central | Quandaries & Queries |
|
Question from Mhiko, a student: please solve this chinese remainder problem..and give me a solution or rule in order to solve this problem/ x=2mod15 |
Hi Mhiko.
if x ≡ 2 mod 15 then there exists some integer i such that 15i + 2 = x.
Similarly, there exists some integer j such that 25j + 1 = x.
thus, 15i + 2 = 25j + 1.
This solves for j:
j = 3i/5 + 1/25.
Recall that j and i are integers. Do you see the problem? Can you explain why there is no solution?
Cheers,
Steve La Rocque.
| ||
| ||
| ||
 |
 |
|
Math Central is supported by the University of Regina and The Pacific Institute for the Mathematical Sciences.