Question 01 (a)
Short answer questions: Each question carries 6 marks, your answers should quote the results being used and show your work.
Find two integers congruent to 3 modulo 5 and 4 modulo 7.
Make sure you understand the problem fully: What is the question asking you to do? Are there specific conditions or constraints that you should take note of? How will you know if your answer is correct from your work only? Can you rephrase the question in your own words in a way that makes sense to you?
If you are stuck, check the hint below. Consider it for a while. Does it give you a new idea on how to approach the problem? If so, try it!
Use techniques related to the Chinese Remainder Theorem.
Checking a solution serves two purposes: helping you if, after having used the hint, you still are stuck on the problem; or if you have solved the problem and would like to check your work.
We seek to solve the system of congruences given by
The first equality says that . Plugging into the second yields . Simplifying yields .
We can find the inverse of 5 by using the Euclidean algorithm however since we are modulo 7, there is only 6 possible candidates so it is faster to just try them all. Since , we see that . This is the same as . Back substituting gives . So two possible answers are given by 18 and 53.