# Finding X for Mod?

by Esteban Sierra   Last Updated October 11, 2018 15:20 PM

If I have this:

• $$x \pmod p = 1$$
• $$x \pmod q = 0$$

Is there any way I can find a possible natural number for $$x$$ that satisfies both equations. I know it has something to do with the Chinese Reminder Theorem; however, I have been unable to solve it.

Tags :