Science:Math Exam Resources/Courses/MATH312/December 2010/Question 08
• Q1 • Q2 • Q3 • Q4 • Q5 • Q6 • Q7 • Q8 •
Question 08 

Prove that the congruence has exactly one solution, . Use the fact that 52579 is a prime. What other property of 52579 is used in your proof? 
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 

Try see what Fermat's Little Theorem and the Euclidean Algorithm can do to attack this problem. 
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.

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. By Fermat's Little Theorem, we have that . The given problem tells us that
Using the Euclidean Algorithm, we can find integers a and b such that . Thus we have that
and this completes the proof. The other property that we used about 52579 is that 52578 and 5 are coprime. 