Science:Math Exam Resources/Courses/MATH312/December 2008/Question 03 (a)

MATH312 December 2008

Work in progress: this question page is incomplete, there might be mistakes in the material you are seeing here.

  •  Q1 (a)  •  Q1 (b)  •  Q1 (c)  •  Q1 (d)  •  Q1 (e)  •  Q1 (f)  •  Q2 (a) i  •  Q2 (a) ii  •  Q2 (a) iii  •  Q2 (a) iv  •  Q2 (b)  •  Q3 (a)  •  Q3 (b)  •  Q3 (c)  •  Q4 (a)  •  Q4 (b)  •  Q4 (c)  •  Q5 (a)  •  Q5 (b)  •  Q5 (c)  •  Q6 (a)  •  Q6 (b)  •  Q6 (c)  •  Q6 (d)  •  

   Other MATH312 Exams

  •  December 2010  •  December 2008  •  December 2005  •  December 2013  •  December 2012  •  December 2009  •  

Question 03 (a)
Determine, using no moduli other than 111 in your final answer, all integers x that satisfy the following linear congruence. $\displaystyle 21x\equiv 6\mod {111}$

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!

Hint
First, isolate for 0, factor then argue that one of the terms has to be divisible by 37. Solve that congruence then lift back to 111.

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. If you are stuck on a problem: Read the solution slowly and as soon as you feel you could finish the problem on your own, hide it and work on the problem. Come back later to the solution if you are stuck or if you want to check your work. If you want to check your work: Don't only focus on the answer, problems are mostly marked for the work you do, make sure you understand all the steps that were required to complete the problem and see if you made mistakes or forgot some aspects. Your goal is to check that your mental process was correct, not only the result.

Solution

Found a typo? Is this solution unclear? Let us know here. Please rate my easiness! It's quick and helps everyone guide their studies. Proceeding as suggested in the hint, we have $\displaystyle 3(7x-2)\equiv 0\mod {111}$ Now, as $\displaystyle 111=3\cdot 37$, we see that we must have $\displaystyle 7x-2\equiv 0\mod {37}$ if the above congruence is to hold. Now, isolating gives $\displaystyle 7x\equiv 2\mod {37}$ We can crunch through the Euclidean algorithm to find the inverse of 7 but here I will use a clever time saving trick. The right hand side is equivalent to $\displaystyle 7x\equiv -35\mod {37}$ Thus, multiplying by the inverse of 7 on both sides yields $\displaystyle x\equiv -5\equiv 32\mod {37}$. Thus, modulo 111, the solutions are $\displaystyle x\equiv 32,69,106\mod {111}$ seen by adding multiples of 37 to 32.

Click here for similar questions

MER QGQ flag, MER RH flag, MER RS flag, MER RT flag, MER Tag Euclidean algorithm, MER Tag Modular arithmetic, Pages using DynamicPageList3 parser function, Pages using DynamicPageList3 parser tag